In the directed graph, a Strongly Related Part is often a subset of vertices where by each vertex during the subset is reachable from every single other vertex in exactly the same subset by traversing the directed edges. FindinIn graph G, distance between v1 and v2 is 2. Since the shortest route Among the many two paths v1– v4– v2 and v1�