hgraph-1.10.0.0: Tools for working on (di)graphs.

Index - M

maxArcDisjointPathsHGraph.Directed.Connectivity.Flow, HGraph.Directed.Connectivity
maxDisjointPathsHGraph.Directed.Connectivity.Flow, HGraph.Directed.Connectivity
maxFlowHGraph.Directed.Connectivity.Flow, HGraph.Directed.Connectivity
maxFlowValueHGraph.Directed.Connectivity.Flow, HGraph.Directed.Connectivity
maximizeHGraph.Undirected.Solvers.IndependentSet
maximumHGraph.Directed.Packing.Cycles.Internal, HGraph.Directed.Packing.Cycles
maximumIHGraph.Directed.Packing.Cycles.Internal, HGraph.Directed.Packing.Cycles
maximumI'HGraph.Directed.Packing.Cycles.Internal
maximumIWeakHGraph.Directed.Packing.Cycles.Internal
metaBfs 
1 (Function)HGraph.Undirected, HGraph.Undirected.AdjacencyMap
2 (Function)HGraph.Directed, HGraph.Directed.AdjacencyMap
mheadHGraph.Utils
minCutHGraph.Directed.Connectivity.Flow, HGraph.Directed.Connectivity
minCutIHGraph.Directed.Connectivity.Flow, HGraph.Directed.Connectivity
minimum 
1 (Function)HGraph.Directed.EditDistance.Acyclic.VertexDeletion.Internal, HGraph.Directed.EditDistance.Acyclic.VertexDeletion
2 (Function)HGraph.Directed.EditDistance.Acyclic.ArcDeletion.Internal, HGraph.Directed.EditDistance.Acyclic.ArcDeletion
minimumI 
1 (Function)HGraph.Directed.EditDistance.Acyclic.VertexDeletion.Internal, HGraph.Directed.EditDistance.Acyclic.VertexDeletion
2 (Function)HGraph.Directed.EditDistance.Acyclic.ArcDeletion.Internal, HGraph.Directed.EditDistance.Acyclic.ArcDeletion
minimumI'HGraph.Directed.EditDistance.Acyclic.VertexDeletion.Internal
minimumIComponents 
1 (Function)HGraph.Directed.EditDistance.Acyclic.VertexDeletion.Internal
2 (Function)HGraph.Directed.EditDistance.Acyclic.ArcDeletion.Internal
minimumVertexCoverHGraph.Undirected.Solvers.VertexCover
Mutable 
1 (Type/Class)HGraph.Undirected, HGraph.Undirected.AdjacencyMap
2 (Type/Class)HGraph.Directed, HGraph.Directed.AdjacencyMap