A cycle in graph idea is shut route during which both of those edges and vertices cannot be recurring. A circuit in graph theory is shut path by which vertices is often repeated but edges can't be recurring.In graph G, distance amongst v1 and v2 is two. Because the shortest path Amongst the two paths v1– v4– v2 and v1– v3– v5– v2 a