// 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.

One of the most classic algorithmic problems deals with calculating the shortest path between two points. A more complicated variant of the problem is when the route traverses a changing network - ...