Topological Sort - Course Schedule II (Topological Order)
You have a list of courses and their prerequisite pairs. You want to find an order to complete all courses so that every course's prerequisites are taken before it. Which algorithmic pattern best fits this problem?
