We were using a breadth-first search which doesn't work as-is for topological ordering in all cases. Instead of using Kahn's algorithm which is a little complex, we switch to a depth-first search. |
||
|---|---|---|
| .. | ||
| lib.rs | ||
We were using a breadth-first search which doesn't work as-is for topological ordering in all cases. Instead of using Kahn's algorithm which is a little complex, we switch to a depth-first search. |
||
|---|---|---|
| .. | ||
| lib.rs | ||