Transitive closure of a directed graph.
Interface with GraphViz
Transitive reduction of a directed graph.
Tarjan's algorithm: calculating SCC of a graph in linear time.
Topological sort of a graph.
Given an implementation of drawing capabilities and of graphs structures, the functor
Given an implementation of graphs structures, the functor