This class implements the algorithm of Chu_Liu_Edmonds to determine an optimal branching (optimal directed graph of order 1).
This is the main class of the graph library.
This class is a representation of a weighted edge.
This class enables you to compute the maximal spanning forest for an undirected, weighted graph.
Class for a topological sort.
This class implements an Union-Find-algorithm with path contraction.