optrees: Optimal Trees in Weighted Graphs

Share:

Finds optimal trees in weighted graphs. In particular, this package provides solving tools for minimum cost spanning tree problems, minimum cost arborescence problems, shortest path tree problems and minimum cut tree problem.

Author
Manuel Fontenla [aut, cre]
Date of publication
2014-09-02 06:14:11
Maintainer
Manuel Fontenla <manu.fontenla@gmail.com>
License
GPL-3
Version
1.0

View on CRAN

Man pages

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...
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...
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-package
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

Files in this package

optrees
optrees/NAMESPACE
optrees/NEWS
optrees/R
optrees/R/removeMultiArcs.R
optrees/R/spTreeDijkstra.R
optrees/R/ghTreeGusfield.R
optrees/R/spTreeBellmanFord.R
optrees/R/stepbackArbor.R
optrees/R/getMinimumArborescence.R
optrees/R/msTreeBoruvka.R
optrees/R/findMinCut.R
optrees/R/getCheapArcs.R
optrees/R/ArcList2Cmat.R
optrees/R/msTreeKruskal.R
optrees/R/optrees.R
optrees/R/maxFlowFordFulkerson.R
optrees/R/findstCut.R
optrees/R/repGraph.R
optrees/R/Cmat2ArcList.R
optrees/R/getMinimumCutTree.R
optrees/R/getMinCostArcs.R
optrees/R/searchWalk.R
optrees/R/searchZeroCycle.R
optrees/R/msArborEdmonds.R
optrees/R/removeLoops.R
optrees/R/checkArbor.R
optrees/R/getMinimumSpanningTree.R
optrees/R/getShortestPathTree.R
optrees/R/msTreePrim.R
optrees/R/getComponents.R
optrees/R/getZeroArcs.R
optrees/R/compactCycle.R
optrees/R/checkGraph.R
optrees/R/searchFlowPath.R
optrees/MD5
optrees/README
optrees/DESCRIPTION
optrees/man
optrees/man/removeLoops.Rd
optrees/man/findMinCut.Rd
optrees/man/maxFlowFordFulkerson.Rd
optrees/man/getMinimumSpanningTree.Rd
optrees/man/getMinimumCutTree.Rd
optrees/man/removeMultiArcs.Rd
optrees/man/getCheapArcs.Rd
optrees/man/getShortestPathTree.Rd
optrees/man/checkArbor.Rd
optrees/man/getMinimumArborescence.Rd
optrees/man/ArcList2Cmat.Rd
optrees/man/getComponents.Rd
optrees/man/searchWalk.Rd
optrees/man/checkGraph.Rd
optrees/man/stepbackArbor.Rd
optrees/man/spTreeDijkstra.Rd
optrees/man/optrees-package.Rd
optrees/man/spTreeBellmanFord.Rd
optrees/man/Cmat2ArcList.Rd
optrees/man/findstCut.Rd
optrees/man/msTreeBoruvka.Rd
optrees/man/repGraph.Rd
optrees/man/msTreePrim.Rd
optrees/man/msArborEdmonds.Rd
optrees/man/getZeroArcs.Rd
optrees/man/searchFlowPath.Rd
optrees/man/ghTreeGusfield.Rd
optrees/man/compactCycle.Rd
optrees/man/searchZeroCycle.Rd
optrees/man/msTreeKruskal.Rd
optrees/man/getMinCostArcs.Rd