import java.util.LinkedList;
import java.util.Queue;
public class Graph {
/**
* @PLA 图的遍历
*/
private int num = 9;// 结点数
private boolean[] flag;// 存储结点是否遍历过
private String[] vertexs = { "A", "B", "C", "D", "E", "F", "G", "H", "I" };// 结点
private int[][] edges = { // 邻接矩阵存储边
{ 0, 1, 0, 0, 0, 1, 1, 0, 0 }, { 1, 0, 1, 0, 0, 0, 1, 0, 1 },
{ 0, 1, 0, 1, 0, 0, 0, 0, 1 }, { 0, 0, 1, 0, 1, 0, 1, 1, 1 },
{ 0, 0, 0, 1, 0, 1, 0, 1, 0 }, { 1, 0, 0, 0, 1, 0,......
阅读全文