Optimal Trees in Weighted Graphs

[Up] [Top]

Documentation for package ‘optrees’ version 1.0

Help Pages

optrees-package Optimal Trees in Weighted Graphs
ArcList2Cmat Builds the cost matrix of a graph from its list of arcs
checkArbor Checks if there is at least one arborescence in the graph
checkGraph Checks if the graph contains at least one tree or one arborescence
Cmat2ArcList Builds the list of arcs of a graph from its cost matrix
compactCycle Compacts the nodes in a cycle into a single node
findMinCut Finds the minimum cut of a given graph
findstCut Determines the s-t cut of a graph
getCheapArcs Substracts the minimum weight of the arcs pointing to each node
getComponents Connected components of a graph
getMinCostArcs Selects the minimum cost of the arcs pointing to each node
getMinimumArborescence Computes a minimum cost arborescence
getMinimumCutTree getMinimumCutTree --- Computes a minimum cut tree
getMinimumSpanningTree Computes a minimum cost spanning tree
getShortestPathTree Computes a shortest path tree
getZeroArcs Selects zero weight arcs of a graph
ghTreeGusfield Gomory-Hu tree with the Gusfield's algorithm
maxFlowFordFulkerson Maximum flow with the Ford-Fulkerson algorithm
msArborEdmonds Minimum cost arborescence with Edmonds' algorithm
msTreeBoruvka Minimum cost spanning tree with Boruvka's algorithm.
msTreeKruskal Minimum cost spanning tree with Kruskal's algorithm
msTreePrim Minimum cost spanning tree with Prim's algorithm
optrees Optimal Trees in Weighted Graphs
removeLoops Remove loops of a graph
removeMultiArcs Remove multi-arcs with no minimum cost
repGraph Visual representation of a graph
searchFlowPath Find a maximum flow path
searchWalk Finds an open walk in a graph
searchZeroCycle Zero weight cycle in a graph
spTreeBellmanFord Shortest path tree with Bellman-Ford algorithm
spTreeDijkstra Shortest path tree with Dijkstra's algorithm
stepbackArbor Go back between two stages of the Edmond's algorithm