Tarjan's strongly connected components algorithm
E323102
UNEXPLORED
Tarjan's strongly connected components algorithm is a classic linear-time graph algorithm that efficiently identifies all strongly connected components in a directed graph using depth-first search and low-link values.
Referenced by (1)
| Subject (surface form when different) | Predicate |
|---|---|
|
Robert Tarjan
→
|
notableConcept |