concept good route in category algorithms
appears as: best route

This is an excerpt from Manning's book Algorithms and Data Structures in Action.
In this section, we will focus on simple directed graphs; no other assumption will be made. We are not restricting ourselves to strongly connected graphs, and in general we don’t have further domain knowledge to choose the vertex from which we should start the search; consequently, we can’t guarantee that a single traversal will cover all the vertices in the graph. On the contrary, several “restarts”, from different starting points are in general needed to visit all the vertices in a graph: we’ll show this while discussing DFS.