Tarjan's strongly connected components algorithm
Tarjan's strongly connected components algorithm is an algorithm in graph theory for finding the strongly connected components (SCCs) of a directed graph. It runs in linear time, matching the time bound for alternative methods including Kosaraju's algorithm and the path-based strong component algorithm. The algorithm is named for its inventor, Robert Tarjan.
- Caption
- enTarjan's algorithm animation
- Comment
- enTarjan's strongly connected components algorithm is an algorithm in graph theory for finding the strongly connected components (SCCs) of a directed graph. It runs in linear time, matching the time bound for alternative methods including Kosaraju's algorithm and the path-based strong component algorithm. The algorithm is named for its inventor, Robert Tarjan.
- Data
- Graph (data structure)
- Depiction
- Has abstract
- enTarjan's strongly connected components algorithm is an algorithm in graph theory for finding the strongly connected components (SCCs) of a directed graph. It runs in linear time, matching the time bound for alternative methods including Kosaraju's algorithm and the path-based strong component algorithm. The algorithm is named for its inventor, Robert Tarjan.
- Is primary topic of
- Tarjan's strongly connected components algorithm
- Label
- enTarjan's strongly connected components algorithm
- Link from a Wikipage to an external page
- github.com/Vacilando/js-tarjan
- github.com/Vacilando/php-tarjan
- rosettacode.org/wiki/Tarjan
- Link from a Wikipage to another Wikipage
- Algorithm
- Category:Articles with example pseudocode
- Category:Graph algorithms
- Category:Graph connectivity
- Directed acyclic graph
- Directed graph
- Donald Knuth
- File:Tarjan's Algorithm Animation.gif
- Graph (data structure)
- Graph theory
- Invariant (computer science)
- Kosaraju's algorithm
- Linear time
- Partition of a set
- Path-based strong component algorithm
- Robert Tarjan
- Spanning forest
- Stack (data structure)
- Strongly connected component
- Topological sorting
- Vertex (graph theory)
- SameAs
- Algorithme de Tarjan
- Algorithmus von Tarjan zur Bestimmung starker Zusammenhangskomponenten
- Algoritmo di Tarjan per le componenti fortemente connesse
- m.026xldr
- Q1972285
- Tardžanov algoritam za nalaženje jako povezanih komponenti
- Tarjan's strongly connected components algorithm
- Tarjan erősen összefüggő komponensek algoritmusa
- Tarjan算法
- Thuật toán tìm thành phần liên thông mạnh của Tarjan
- tVpF
- Алгоритм Тар'яна
- Алгоритм Тарьяна
- الگوریتم تارژان مؤلفههای قویا همبند
- ขั้นตอนวิธีของทาร์จัน
- Subject
- Category:Articles with example pseudocode
- Category:Graph algorithms
- Category:Graph connectivity
- Thumbnail
- WasDerivedFrom
- Tarjan's strongly connected components algorithm?oldid=1105178665&ns=0
- WikiPageLength
- 12318
- Wikipage page ID
- 8244667
- Wikipage revision ID
- 1105178665
- WikiPageUsesTemplate
- Template:Infobox algorithm
- Template:Quote
- Template:Rp
