Does topological sort exist for any complete directed acyclic graph?
-
06-11-2019 - |
Question
Let's assume that DAG is complete: there is directed edge among every to nodes. Does topological sort of vertices exist for any such graph? I.e. is it possible to make linear list of nodes in which the left node has edge into the right node. Maybe this is the question about existence of Hamiltonian path in every complete DAG?
No correct solution
Licensed under: CC-BY-SA with attribution
Not affiliated with cs.stackexchange