Tarjan's strongly connected components algorithm
Sign in to saveAlso known as Tarjan's Algorithm
graph theory algorithm
In the Vinony graph
Within Vinony's link graph, Tarjan's strongly connected components algorithm is referenced by 10 other articles, and connects out to time complexity, International Standard Book Number and algorithm.
It is catalogued under topics including Graph algorithms and Graph connectivity.
Its subject is documented across 13 Wikipedia language editions.
Wikidata facts
- Image
- Tarjan's Algorithm Animation.gif
Show 1 more fact
- ACM Classification Code (2012)
- 10010917
Sources (1)
via Wikidata · CC0
Connections
time complexity
Entity
International Standard Book Number
Entity
algorithm
Entity
digital object identifier
Entity
Donald Knuth
Entity
graph theory
Entity
stack
Entity
pseudocode
Entity
depth-first search
Entity
partition of a set
Entity
node
Entity
directed graph
Entity
invariant
Entity
Robert Tarjan
Entity
spanning tree
Entity
graph data structure
Entity
directed acyclic graph
Entity
CiteSeerX
Entity
topological sorting
Entity
strongly connected component
Entity