An efficient algorithm for computing strongly-connected components should be added. The result should be a view of the graph which is itself a tree of components. It should support querying the component of a vertex of the original graph and finding paths between vertices in a component.
An efficient algorithm for computing strongly-connected components should be added. The result should be a view of the graph which is itself a tree of components. It should support querying the component of a vertex of the original graph and finding paths between vertices in a component.