|
Related articles:
Directed acyclic graph
Depth-first search
Key terms: order topological sort node edges graph algorithm y if topological sort visit set partial order dag directed linear topological ordering vertices objects path relation total order cycle hamiltonian path perform each node must exists sequence tasks scheduling least one vertex possible every remove output already depends computer science node n described reachability note valid call been visited empty comparison unique all nodes insert acyclic graph whenever solution Search external links cited by footnotes on Wikipedia page Topological sorting: |
|