Please sign in to comment.
- Loading branch information...
|@@ -1,4 +1,4 @@|
|-Ruby class for [calculating the strongly sonnected components](http://maetl.coretxt.net.nz/scc-in-ruby)|
|+Ruby class for [calculating the strongly connected components](http://maetl.coretxt.net.nz/scc-in-ruby)|
|of a directed graph.|
|Operates on graphs constructed with the Set data structure. Finds the strongly connected components of a digraph using the [improved algorithm](http://www.mcs.vuw.ac.nz/~djp/files/P05.pdf) described by David Pearce.|