Major Description
The algorithm is as follows
1. find zero in-degree nodes from a copied graph.
2. remove nodes from the copied graph and add them to the output
3. repeat 1
The issue is that step 1 traverses all remaining nodes each time, which costs the algorithm O(n^2) time
Graph#hasCycle has a similar issue
Attachments
Issue Links
- links to
