September 2015
Beginner to intermediate
608 pages
13h 43m
English
Traversal algorithms concern themselves with the ways of exploring the graph in a systematic way. Given the huge variety of phenomena that can be modeled with graphs, such algorithms could have a huge variety of uses.
The algorithms we'll consider in the next few sections concern some of the most common tasks such as:
If the graph in question represented the road network covered by a delivery driver's round, the vertices could represent intersections. Finding a path that traces each edge exactly once would be the way a delivery driver would travel ...
Read now
Unlock full access