Applications When looking at code/library dependencies, one may want to see which code pieces form strongly connected components, and...
Topological Sort A topological sort is a traversal of a digraph with ordering constraints. Let each node have some value/weight. It is a...
The depth first search algorithm is a way to traverse all the nodes in a graph. The algorithm is trivial: Start at a given node. Mark it...