maxArcDisjointPaths | HGraph.Directed.Connectivity.Flow, HGraph.Directed.Connectivity |
maxDisjointPaths | HGraph.Directed.Connectivity.Flow, HGraph.Directed.Connectivity |
maxFlow | HGraph.Directed.Connectivity.Flow, HGraph.Directed.Connectivity |
maxFlowValue | HGraph.Directed.Connectivity.Flow, HGraph.Directed.Connectivity |
maximize | HGraph.Undirected.Solvers.IndependentSet |
maximum | HGraph.Directed.Packing.Cycles.Internal, HGraph.Directed.Packing.Cycles |
maximumI | HGraph.Directed.Packing.Cycles.Internal, HGraph.Directed.Packing.Cycles |
maximumI' | HGraph.Directed.Packing.Cycles.Internal |
maximumIWeak | HGraph.Directed.Packing.Cycles.Internal |
metaBfs | |
1 (Function) | HGraph.Undirected, HGraph.Undirected.AdjacencyMap |
2 (Function) | HGraph.Directed, HGraph.Directed.AdjacencyMap |
mhead | HGraph.Utils |
minCut | HGraph.Directed.Connectivity.Flow, HGraph.Directed.Connectivity |
minCutI | HGraph.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 |
minimumVertexCover | HGraph.Undirected.Solvers.VertexCover |
Mutable | |
1 (Type/Class) | HGraph.Undirected, HGraph.Undirected.AdjacencyMap |
2 (Type/Class) | HGraph.Directed, HGraph.Directed.AdjacencyMap |