Please enable JavaScript.
Coggle requires JavaScript to display documents.
MM10 - Coggle Diagram
MM10
-
-
Topological Sorting
Depth-first search and breadth-first search are principal traversal algorithms for traversing digraphs
if a DFS forest of a digraph has no back edges, the digraph is a dag, an acronym for directed acyclic graph.
The situation can be modeled by a digraph in which vertices represents courses and directed edges indicate prerequisite requirements.In term of this digraph,the question is wheter we can list its vertices in such an order that for every edge in the graph,the vertex where the edge starts is listed before the vertes where the edge ends.