In the directed graph, a Strongly Related Part can be a subset of vertices in which each and every vertex inside the subset is reachable from each other vertex in a similar subset by traversing the directed edges. Findin In graph G, distance in between v1 and v2 is 2. https://torreyy627ttt4.snack-blog.com/profile