A C E F G H I J M R S T U V 

M

makeSet(E) - Method in class jto.p5graphtheory.Graph.DisjointSet
This creates a new LinkedList that contains the one object that is the parameter, and adds it to the list of LinkedLists.
minimalSpanningTree(Graph) - Static method in class jto.p5graphtheory.Graph
This is an implementation of Kruskal's Algorithm for finding the minimal spanning tree of a graph.
This will work for disconnected graphs, but it will return a Graph which contains multiple distinct trees.
minimalSpanningTree(Collection<Vertex>) - Static method in class jto.p5graphtheory.Graph
This is an implementation of Kruskal's Algorithm for finding the minimal spanning tree for the given collection of Vertex objects.

This will return a minimal spanning tree for the complete graph that contains these vertices.
A C E F G H I J M R S T U V