Metraipolis › archive › dc_ce677e3bd345
Kosaraju's algorithm — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Kosaraju%27s_algorithm
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-06T14:06:34.329Z
- SHA-256 of the archived text
9ce74c1427b4f3a010e416342e5dfbd9681e655903b710dbca3c4160566ac377- Stable URL of this page
https://metraipolis.com/documento/dc_ce677e3bd345
How to cite
Kosaraju's algorithm — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Kosaraju%27s_algorithm (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_ce677e3bd345 (Metraipolis archive dc_ce677e3bd345, sha256 9ce74c1427b4f3a010e416342e5dfbd9681e655903b710dbca3c4160566ac377)
BibTeX
@misc{dcce677e3bd345,
title = {Kosaraju's algorithm — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Kosaraju%27s_algorithm},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_ce677e3bd345; sha256 9ce74c1427b4f3a010e416342e5dfbd9681e655903b710dbca3c4160566ac377},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Kosaraju%27s_algorithm. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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. Tema degli esploratori: statistica e scienza dei dati (deposito sistematico; ricerca «algorithm»). Fonte: Wikipedia in inglese, voce «Kosaraju's algorithm» — https://en.wikipedia.org/wiki/Kosaraju%27s_algorithm Wikidata Q2655281: «algorithm to find the strongly connected component of a directed graph» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q2655281 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Kosaraju%27s_algorithm?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1368414214, consultata il 2026-10-06T12:26:06.739Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 952ad1bb23cbac860f573493bd351f975063609d042e61c7780313d9c3d4511c