What type of graph must be used to allow for a topological sort?
Show answer
Directed Acyclic Graph (DAG)
A topological sort is a linear ordering of vertices such that for every directed edge (u, v), u comes before v. This is only possible if the graph has no directed cycles.
Also asked as:
- A topological sort is only possible on what specific type of graph?