FACTS ABOUT CIRCUIT WALK REVEALED

Walks are any sequence of nodes and edges in the graph. In such cases, both equally nodes and edges can repeat during the sequence.In graph G, length in between v1 and v2 is 2. Since the shortest path among the two paths v1– v4– v2 and v1– v3– v5– v2 among v1 and v2 is of duration 2.Kelvin SohKelvin Soh 1,8151212 silver badges1