Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:appliesTo |
directed graphs
|
| gptkbp:complexity |
O(V+E)
|
| gptkbp:field |
computer science
|
| https://www.w3.org/2000/01/rdf-schema#label |
Kosaraju's Algorithm
|
| gptkbp:introducedIn |
1978
|
| gptkbp:namedAfter |
gptkb:S._Rao_Kosaraju
|
| gptkbp:numberOfStages |
perform DFS and record finish order
|
| gptkbp:output |
list of strongly connected components
|
| gptkbp:relatedTo |
gptkb:Gabow's_algorithm
gptkb:Tarjan's_algorithm |
| gptkbp:step |
perform DFS in order of decreasing finish time
reverse all edges two-pass depth-first search |
| gptkbp:usedFor |
finding strongly connected components
|
| gptkbp:bfsParent |
gptkb:Graph_Algorithms
|
| gptkbp:bfsLayer |
6
|