图的最小生成树

import java.util.Stack;

/*
 * 图的最小生成树
 */
public class MSTDemo {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		char[] vertices = {'A', 'B', 'C', 'D', 'E'};
		int[][] edges = {
				{0, 1, 1, 1, 1},
				{1, 0, 1, 1, 1},
				{1, 1, 0, 1, 1},
				{1, 1, 1, 0, 1},
				{1, 1, 1, 1, 0}
			};
		
		boolean[] isVisited = new boolean[vertices.length];
		Stack<Integer> stack = new Stack<Integer>();
		stack.push(0);
		isVisited[0] = true;

		while(!stack.isEmpty()) {
			int par = stack.peek();
			int v = getAdjUnvisitedVertex(par, edges, isVisited);
			if(v == -1) {
				stack.pop();
			} else {
				stack.push(v);
				isVisited[v] = true;
				System.out.print(vertices[par]);
				System.out.print(vertices[v] + " ");
			}
		}
		System.out.println();
	}

	public static int getAdjUnvisitedVertex(int cur, int[][] edges, boolean[] isVisited) {
		// TODO Auto-generated method stub
		for(int i = 0; i < edges[cur].length; i++) {
			if(edges[cur][i]==1 && !isVisited[i]) {
				return i;
			}
		}
		return -1;
	}

}

输出结果：

AB BC CD DE