13.14 AND NOW … A SIMPLE ROUTE FINDING ILLUSTRATION

An important operation is that of finding a path between two points. We will develop a simple method for our example graph (Figure 13.6), using the depth-first algorithm. The choice of traversal strategy may well result in different routes, and in a large and more complex graph there will probably be many, but here only a small number of alternative paths exist—even fewer since its edges are directed.

Essentially, the process is that of traversal with three differences: