Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

Tarjan's strongly connected components algorithm · Vinony

EntityQ1972285· pop 13· linked from 10 articles

Tarjan's strongly connected components algorithm

Sign in to save

graph theory algorithm

Connections

time complexity

International Standard Book Number

digital object identifier

depth-first search

partition of a set

graph data structure

directed acyclic graph

topological sorting

strongly connected component

Categories

Graph algorithms Graph connectivity

Sources

wikipedia.externallinksexternallink

What links here10 pages

Tarjan's off-line least common ancestors algorithm

2-satisfiability

Kosaraju's algorithm

topological sorting

strongly connected component

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

Kernighan–Lin algorithm

Entitydist 0.45

Tarjan's off-line least common ancestors algorithm

Entitydist 0.49

Bareiss algorithm

Entitydist 0.53

Goertzel algorithm

Entitydist 0.54

Cuthill–McKee algorithm

Entitydist 0.55

Laplacian matrix

Entitydist 0.56

Numerical Recipes

Entitydist 0.59

Cistercian architecture

Entitydist 0.60

Clenshaw algorithm

Entitydist 0.60

Entitydist 0.62

computational astrophysics

Entitydist 0.62

Lanczos algorithm

Entitydist 0.62