Tarjan's strongly connected components algorithm: Difference between revisions

Revision as of 23:31, 17 July 2016

Revision as of 15:26, 25 July 2016

Line 91:

[[Donald Knuth]] described Tarjan's algorithm as one of Knuth's favorite implementations in his book ''The Stanford GraphBase''.<ref>Knuth, ''The Stanford GraphBase'', pages 512–519.</ref>

He also wrote: <ref>{{cite web|last=Harrison|first=Knuth|title=Twenty Questions for Donald Knuth|url=http://www.informit.com/articles/article.aspx?p=2213858&WT.mc_id=Author_Knuth_20Questions}}</ref> {{quote|The data structures that he devised for this problem fit together in an amazingly beautiful way, so that the quantities you need to look at while exploring a directed graph are always magically at your fingertips. And his algorithm also does topological sorting as a byproduct.}}

== References ==

Line 97:

== External links ==

*[httphttps://stackoverflow.com/questions/6643076/tarjan-cycle-detection-help-c#sca Implementation of Tarjan's Algorithm in .NET]

*[https://github.com/danielrbradley/CycleDetection Implementation of Tarjan's Algorithm in .NET (GitHub)]

*[http://www.vacilando.org/article/php-implementation-tarjans-cycle-detection-algorithm Implementation of Tarjan's Algorithm in PHP]