graph icon indicating copy to clipboard operation
graph copied to clipboard
verified publisher icon cbbowen

Strongly-connected components

Open cbbowen opened this issue 7 years ago • 0 comments

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.

cbbowen avatar Apr 08 '18 05:04 cbbowen