Leetcode #207 Course Schedule

For this type of scheduling question, it can be solved using Topological Sort. It's basically Graph BFS problem. Though process: Initialize graph Build the graph Find the source node ( A node with no incoming edge) Traverse the graph via BFS, using ...