Topological sorts on DAGs
Indicates when two DAGs have a shared topological sort. Indicate when a given topological sort of a DAG can be extended into another DAG. Indicate when every topological sorts of a DAG can be extended into another DAG. Provide the time complexity of the above.
graph algorithms directed acyclic graph (dag) topological sort (topological ordering) breadth-first search (bfs) depth-first search (dfs)