topological sort

https://leetcode.com/problems/course-schedule/description We can follow the steps introduced in https://leetcode-solution.com/breadth-first-search to solve this problem. Let’s take a look at the solution:

https://www.lintcode.com/problem/127/description We can follow the steps introduced in https://leetcode-solution.com/breadth-first-search to solve this problem. One thing to note is that, for topological sorting, we do NOT have a variable called visited to record visited nodes while BFS. Why? First of all,… Read More »Lintcode 127 Topological Sorting