Safari Books Online is a digital library providing on-demand subscription access to thousands of learning resources.
|
Consider the graph shown in Figure 9.19. Let us imagine that the vertices are towns and the edges are roads connecting them. It is clear that we can travel from a to B by road but there is no such roadway between D and H. To reach B from a, we take the following route:
Figure 9.19.Naturally, we may represent the above route as |
Definition 9.11: Let G be a graph and u, v be two vertices. A u - v walk in G is defined as a finite sequence