In the directed graph, a Strongly Linked Part is usually a subset of vertices the place just about every vertex from the subset is reachable from every other vertex in the same subset by traversing the directed edges. FindinIn graph G, length between v1 and v2 is two. Since the shortest route One of the two paths v1– v4– v2 and v1– v3�