Java用鄰接矩陣儲存圖的範例程式碼

package graph;
 
import java.util.Scanner;
 
public class CreateAMGraph {
    static final int MaxVnum = 100;  // 頂點數最大值
 
    static int locatevex(AMGraph G, char x) {
        for (int i = 0; i < G.vexnum; i++) // 查詢頂點資訊的下標
            if (x == G.Vex[i])
                return i;
        return -1; // 沒找到
    }
 
    static void CreateAMGraph(AMGraph G) {
        Scanner scanner = new Scanner(System.in);
        int i, j;
        char u, v;
        System.out.println("請輸入頂點數：");
        G.vexnum = scanner.nextInt();
        System.out.println("請輸入邊數:");
        G.edgenum = scanner.nextInt();
        System.out.println("請輸入頂點資訊:");
 
        // 輸入頂點資訊，存入頂點資訊陣列
        for (int k = 0; k < G.vexnum; k++) {
            G.Vex[k] = scanner.next().charAt(0);
        }
        //初始化鄰接矩陣所有值為0，如果是網，則初始化鄰接矩陣為無窮大
        for (int m = 0; m < G.vexnum; m++)
            for (int n = 0; n < G.vexnum; n++)
                G.Edge[m][n] = 0;
 
        System.out.println("請輸入每條邊依附的兩個頂點：");
        while (G.edgenum-- > 0) {
            u = scanner.next().charAt(0);
            v = scanner.next().charAt(0);
 
            i = locatevex(G, u);// 查詢頂點 u 的儲存下標
            j = locatevex(G, v);// 查詢頂點 v 的儲存下標
            if (i != -1 && j != -1)
                G.Edge[i][j] = G.Edge[j][i] = 1; //鄰接矩陣儲置1
            else {
                System.out.println("輸入頂點資訊錯！請重新輸入！");
                G.edgenum++; // 本次輸入不算
            }
        }
    }
 
    static void print(AMGraph G) { // 輸出鄰接矩陣
        System.out.println("圖的鄰接矩陣為：");
        for (int i = 0; i < G.vexnum; i++) {
            for (int j = 0; j < G.vexnum; j++)
                System.out.print(G.Edge[i][j] + "t");
            System.out.println();
        }
    }
 
    public static void main(String[] args) {
        AMGraph G = new AMGraph();
        CreateAMGraph(G);
        print(G);
    }
}
 
class AMGraph {
    char Vex[] = new char[CreateAMGraph.MaxVnum];
    int Edge[][] = new int[CreateAMGraph.MaxVnum][CreateAMGraph.MaxVnum];
    int vexnum; // 頂點數
    int edgenum; // 邊數
}