0.9.0
- Rewrite the topological sort DFS to be more efficient (and work!) on large graphs.
- No longer uses recursion to avoid stack overflows with large/deep graphs
- No longer is accidentally
O(N^2)
(thanks willtennien for pointing this out!)
O(N^2)
(thanks willtennien for pointing this out!)