THE BEST SIDE OF CIRCUIT WALK

A cycle in graph concept is shut path wherein the two edges and vertices can not be repeated. A circuit in graph principle is closed trail by which vertices is often repeated but edges can't be repeated.In graph G, distance among v1 and v2 is 2. As the shortest path among the two paths v1– v4– v2 and v1– v3– v5– v2 among v1 and