Tarjan's strongly connected components algorithm
Graph theory 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.
Nº Q1972285 ★
Common · Knowledge
Tarjan's strongly connected components algorithm
Graph theory 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.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
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.
Text: Wikipédia, CC BY-SA 4.0. · Image: LynX (CC BY-SA 3.0) ·
Related cards
Kosaraju's algorithm
Algorithm to find the strongly connected component of a directed graph
Nº Q2655281 ★
Exponentiation by squaring
Algorithm
Nº Q864127 ★★
Dijkstra's algorithm
Graph search algorithm
Nº Q8548 ★★★★
Strassen algorithm
First subcubic matrix multiplication algorithm
Nº Q728507 ★★
Kruskal's algorithm
Minimum spanning forest algorithm that greedily adds edges
Nº Q797860 ★★
Subset sum problem
Decision problem in computer science
Nº Q1154420 ★★