A cycle in graph principle is closed path wherein the two edges and vertices can not be recurring. A circuit in graph theory is closed trail where vertices may be recurring but edges cannot be repeated. In graph G, distance in between v1 and v2 is 2. Since the shortest https://joseonp395opo2.frewwebs.com/profile