Finds all weak components in a graph where a weak component is defined as
a maximal subgraph in which all pairs of vertices in the subgraph are reachable from one
another in the underlying undirected subgraph.
This algorithm measures the importance of nodes based upon both the number and length of disjoint paths that lead
to a given node from each of the nodes in the root set.