Checks if there is at least one arborescence in the graph
Computes a minimum cost arborescence
Computes a minimum cost spanning tree
Selects the minimum cost of the arcs pointing to each node
Remove loops of a graph
Remove multi-arcs with no minimum cost
Finds the minimum cut of a given graph
getMinimumCutTree ----------------------------------------------------------
Computes a minimum cut tree
Substracts the minimum weight of the arcs pointing to each node
Zero weight cycle in a graph
Checks if the graph contains at least one tree or one arborescence
Builds the cost matrix of a graph from its list of arcs
Gomory-Hu tree with the Gusfield's algorithm
Builds the list of arcs of a graph from its cost matrix
Selects zero weight arcs of a graph
Minimum cost spanning tree with Boruvka's algorithm.
Visual representation of a graph
Go back between two stages of the Edmond's algorithm
Shortest path tree with Dijkstra's algorithm
Finds an open walk in a graph
Connected components of a graph
Minimum cost spanning tree with Prim's algorithm
Determines the s-t cut of a graph
Minimum cost spanning tree with Kruskal's algorithm
Maximum flow with the Ford-Fulkerson algorithm
Computes a shortest path tree
Find a maximum flow path
Shortest path tree with Bellman-Ford algorithm
Compacts the nodes in a cycle into a single node
Minimum cost arborescence with Edmonds' algorithm
Optimal Trees in Weighted Graphs