Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:alternativeTo |
depth-first search topological sort
|
| gptkbp:appliesTo |
directed acyclic graphs
|
| gptkbp:category |
graph
|
| gptkbp:complexity |
O(V + E)
|
| gptkbp:detects |
cycles in directed graphs
|
| gptkbp:field |
computer science
|
| https://www.w3.org/2000/01/rdf-schema#label |
Kahn's Algorithm
|
| gptkbp:input |
gptkb:directed_acyclic_graph
|
| gptkbp:output |
topological order
|
| gptkbp:proposedBy |
Arthur B. Kahn
|
| gptkbp:relatedTo |
topological order
dependency resolution cycle detection |
| gptkbp:step |
find all nodes with no incoming edges
remove all outgoing edges from that node remove node from graph and add to output repeat until all nodes are processed |
| gptkbp:usedFor |
topological sorting
|
| gptkbp:yearProposed |
1962
|
| gptkbp:bfsParent |
gptkb:Topological_Sort
|
| gptkbp:bfsLayer |
7
|