You can finish all courses iff the prerequisite graph has no cycle.
Topological sort (Kahn’s algorithm):
b -> a for prerequisite b before a.A directed graph is acyclic iff a topological ordering visits all nodes.
You can finish all courses iff the prerequisite graph has no cycle.
Topological sort (Kahn’s algorithm):
b -> a for prerequisite b before a.A directed graph is acyclic iff a topological ordering visits all nodes.