Appendix E — Finding the shortest path through a product wheel

Figure E.1 can be used find the shortest path from A to A through the product wheel. The five product graph requires us to solve all four graphs concurrently; make one move on each graph in turn, the first one to complete will be the shortest path. If more than one graph completes in each round, select the shortest one. There maybe more than one sequence (or path through the network) with the same shortest time, indicating that there are multiple solutions to the problem.

Figure E.1: Directed acyclic graphs for solving the product wheel problem