Live briefing
Everything about Tarjan's strongly connected components algorithm
Graph 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. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Tarjan's strongly connected components algorithmA 5-minute orientation
- Pick up a classic book: ICCREM 2015The most-reprinted book on the subject
- Go sideways: Biconnected componentA closely related topic
- Go sideways: Strongly connected componentA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
- No matching papers found.
📚 Books worth reading
- 📕ICCREM 2015Sweden) International Conference on Construction and Real Estate Management (2015 Luleå · 2015
Encyclopedia of Measurement and Statistics 3-Volume SetNeil J. Salkind · 2006
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Biconnected component In graph theory, a biconnected component or block (sometimes known as a 2-connected component) is a maximal biconnected subgraph. Any connected graph decomposes…
- Strongly connected component In the mathematical theory of directed graphs, a graph is said to be strongly connected if every vertex is reachable from every other vertex. The strongly…
- Depth-first search In computer science, depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. The algorithm starts at the root…
- Path-based strong component algorithm In graph theory, the strongly connected components of a directed graph may be found using an algorithm that uses depth-first search in combination with…
- Graph traversal In computer science, graph traversal (also known as graph search) refers to the process of visiting (checking and/or updating) each vertex in a graph.…
- Bridge (graph theory) In graph theory, a bridge, isthmus, cut-edge, or cut arc is an edge of a graph whose deletion increases the graph's number of connected components. Equivalently…
- Weak component In graph theory, the weak components of a directed graph partition the vertices of the graph into subsets that are totally ordered by reachability. They…
- Topological sorting In computer science, a topological sort or topological ordering of a directed graph is a linear ordering of its vertices such that for every directed edge…