1 Unweighted Graphs
For unweighted Graphs, a minimum spanning tree(MST) means that a graph with minimum number of edges to connect all the vertices.
the number of edges E in a minimum spanning tree is always one less than the number of vertices V: E = V – 1.
The path of the DFS(depth-first search) through the graph must be a minimum spanning tree.
1.1 Java implement
public void mst() // minimum spanning tree (depth first)
{ // start at 0
vertexList[0].wasVisited = true; // mark it
theStack.push(0); // push it
while( !theStack.isEmpty() ) // until stack emp