Kosaraju's algorithm
Algorithm to find the strongly connected component of a directed graph
In computer science, Kosaraju-Sharir's algorithm (also known as Kosaraju's algorithm) is a linear time algorithm to find the strongly connected components of a directed graph. Aho, Hopcroft and Ullman credit it to S. Rao Kosaraju and Micha Sharir.
Nº Q2655281 ★
Common · Knowledge
Kosaraju's algorithm
Algorithm to find the strongly connected component of a directed graph
In computer science, Kosaraju-Sharir's algorithm (also known as Kosaraju's algorithm) is a linear time algorithm to find the strongly connected components of a directed graph. Aho, Hopcroft and Ullman credit it to S. Rao Kosaraju and Micha Sharir.
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
In computer science, Kosaraju-Sharir's algorithm (also known as Kosaraju's algorithm) is a linear time algorithm to find the strongly connected components of a directed graph. Aho, Hopcroft and Ullman credit it to S. Rao Kosaraju and Micha Sharir. Kosaraju suggested it in 1978 but did not publish it, while Sharir independently discovered it and published it in 1981. It makes use of the fact that the transpose graph (the same graph with the direction of every edge reversed) has exactly the same strongly connected components as the original graph.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
Tarjan's strongly connected components algorithm
Graph theory algorithm
Nº Q1972285 ★
Dijkstra's algorithm
Graph search algorithm
Nº Q8548 ★★★★
Prim's algorithm
Algorithm for finding the minimum spanning tree for weighted undirected graphs
Nº Q470813 ★★
Bresenham's line algorithm
Algorithm for rasterizing a straight line
Nº Q549860 ★★
A* search algorithm
Algorithm used for pathfinding and graph traversal
Nº Q277680 ★★★
Grover's algorithm
Quantum unstructured search algorithm that finds with high probability the unique input to a black box function that produces a particular output value using 𝑂(𝑁) evaluations
Nº Q1028292 ★★