Kosaraju's algorithm (Q7400858)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
algorithm to find the strongly connected component of a directed graph
- Kosaray-Sharir's algorithm
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Kosaraju's algorithm |
algorithm to find the strongly connected component of a directed graph |
|
Statements
Identifiers
117382039
0 references
