Free Trial

Safari Books Online is a digital library providing on-demand subscription access to thousands of learning resources.

  • Create BookmarkCreate Bookmark
  • Create Note or TagCreate Note or Tag
  • PrintPrint
Share this Page URL
Help

Chapter 13. Graphs > 13.14 AND NOW … A SIMPLE ROUTE FINDING ILLUSTRATION

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:


  

You are currently reading a PREVIEW of this book.

                                                                                                                    

Get instant access to over $1 million worth of books and videos.

  

Start a Free Trial


  
  • Safari Books Online
  • Create BookmarkCreate Bookmark
  • Create Note or TagCreate Note or Tag
  • PrintPrint