- Matrix - Class in graph.math
-
Class represents a mathematical matrix
- Matrix(int, int) - Constructor for class graph.math.Matrix
-
Constructs an empty matrix with the given number of row and columns
- MatrixUtil - Class in graph.math
-
A class containing certain methods for working with matrices
- MatrixUtil() - Constructor for class graph.math.MatrixUtil
-
- maximalSplitPairs(Graph<V, E>, E) - Method in class graph.properties.splitting.Splitting
-
Finds a list of maximal split pair with respect to some edge
A maximal split pair with respect to some edge
is a split pair not dominated by any other split pair with respect to that edge
There may several such pairs
- MaximumPlanaritySubgraph<V extends Vertex,E extends Edge<V>> - Class in graph.algorithms.planarity
-
Finds maximum planar subgraph
A widely used standard heuristic for finding a maximal planar subgraph is to start with
a spanning tree of G, and to iteratively try to add the remaining edges one by one
In every step, a planarity testing algorithm is called for the obtained graph.
- MaximumPlanaritySubgraph(Graph<V, E>) - Constructor for class graph.algorithms.planarity.MaximumPlanaritySubgraph
-
- McKayGraphLabelingAlgorithm<V extends Vertex,E extends Edge<V>> - Class in graph.symmetry.nauty
-
Implementation of McKay's canonical graph labeling algorithm
- McKayGraphLabelingAlgorithm(Graph<V, E>) - Constructor for class graph.symmetry.nauty.McKayGraphLabelingAlgorithm
-
- moveBy(int, int) - Method in class graph.drawing.Drawing
-
Moves all vertices horizontally and vertically
- moveByIncludingEdges(int, int) - Method in class graph.drawing.Drawing
-
Moves the whole drawing horizontally and vertically
- mul(Permutation) - Method in class graph.symmetry.Permutation
-
Multiplies this permutation with the provided one