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.

Kosaraju's algorithm · Vinony

Kosaraju's algorithm

EntityQ2655281· pop 11· linked from 12 articles

Kosaraju's algorithm

Sign in to save

algorithm to find the strongly connected component of a directed graph

Wikidata facts

Based on: depth-first search

Show 2 more facts

P1056: strongly connected component
P1269: strongly connected component

via Wikidata · CC0

Connections

computer science

International Standard Book Number

Categories

Graph algorithms Graph connectivity

Sources

wikipedia.externallinksexternallink
Wikidata (CC0)wikidata-claims
Pixabayimage-pixabay

algorithm

Entity

digital object identifier

depth-first search

breadth-first search

adjacency matrix

time complexity

John Edward Hopcroft

Jeffrey David Ullman

strongly connected component

Tarjan's strongly connected components algorithm

transpose graph

graph operation

What links here12 pages

graph data structure

2-satisfiability

Tarjan's strongly connected components algorithm

strongly connected component

Andhra University

transpose graph

Similar entities

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

Entitydist 0.39

Category:Directed graphs

Entitydist 0.52

Entitydist 0.53

Category:Directed acyclic graphs

Entitydist 0.57

Girvan–Newman algorithm

Entitydist 0.58

Entitydist 0.58

Entitydist 0.58

community structure

Entitydist 0.60

kinematic diagram

Entitydist 0.62

hypercube graph

Entitydist 0.62

adjacency matrix

Entitydist 0.62

perfect graph theorem

Entitydist 0.63