13.16 LIMITATIONS OF THE PATH-SEARCHING FUNCTION

For larger graphs, different traversal strategies result in alternative routes and distances; it is often necessary to select the shortest among them. The simple method we have developed is not intended for that purpose. We will describe a more sophisticated process that finds the shortest path.