2 ms·
there’s a single algorithm (Tarjan’s) that actually solves all your graph needs. It returns a reverse topologically sorted DAG of strongly connected components
by bwasti 8y ago
there’s a single algorithm (Tarjan’s) that actually solves all your graph needs. It returns a reverse topologically sorted DAG of strongly connected components
- CyberShadow 8y agoYes, but I need to sort by two criteria, and Kosaraju's algorithm is simpler to implement :)