Section 8.4
Section 8.4. Connectivity. Paths. In an undirected graph, a path of length n from u to v, where n is a positive integer, is a sequence of edges e 1 , … , e n of the graph such that f(e 1 )={x 0 ,x 1 }, f(e 2 )={x 1 ,x 2 }, … , f(e n )={x n-1 ,x n } where x 0 = u and x n = v
242 views • 16 slides