// and ending with item2. The list has one item if item1 and item2 are the // same, or no items if the path does not exist.

* Why do you want to base this on Dijkstra's algorithm, which is designed to find a single shortest-path? Surely there are better options for your base implementation. A quick Google search suggests a ...