Topological Sort - Course Schedule II (Topological Order)
Consider a graph with 4 courses and prerequisites [[1,0],[2,0],[3,1],[3,2]]. Using Kahn's Algorithm, which of the following is a valid order to complete all courses?
15+ quiz questions · All difficulty levels · Free
Free Signup - Practice All Questions