Java数据结构——图的创建

import java.util.ArrayList;
import java.util.Arrays;

public class Graph {
    private ArrayList<String> vertexList;  //存储顶点集合
    private int[][] edges;  //存储邻接矩阵
    private int edgesNum;  //存储边的数目

    public static void main(String[] args) {
        int n = 5;  //顶点个数
        String[] Vertex = {"A", "B", "C", "D", "E"};
        Graph graph = new Graph(n);
        for (String vertex : Vertex) {
            graph.insertVertex(vertex);
        }
        //A-B A-C B-C B-E C-D D-E
        graph.insertEdges(0, 1, 1);
        graph.insertEdges(0, 2, 1);
        graph.insertEdges(1, 2, 1);
        graph.insertEdges(1, 4, 1);
        graph.insertEdges(2, 3, 1);
        graph.insertEdges(3, 4, 1);
        graph.showGraph();
    }

    public Graph(int n) {
        edges = new int[n][n];
        vertexList = new ArrayList<String>(n);
        edgesNum = 0;
    }

    //插入顶点
    public void insertVertex(String vertex) {
        vertexList.add(vertex);
    }

    //添加边
    //v1代表第一个顶点下标，v2代表第二个顶点下标，weight代表权值
    public void insertEdges(int v1, int v2, int weight) {
        edges[v1][v2] = weight;
        edges[v2][v1] = weight;
        edgesNum++;
    }

    //返回顶点的个数
    public int getVertexNum() {
        return vertexList.size();
    }

    //返回边的个数
    public int getEdgesNum() {
        return edgesNum;
    }

    //返回顶点i对应的数据
    public String getValue(int index) {
        return vertexList.get(index);
    }

    //返回v1、v2的权值
    public int getWeight(int v1, int v2) {
        return edges[v1][v2];
    }

    //显示图对应的矩阵
    public void showGraph() {
        for (int[] arr : edges) {
            System.err.println(Arrays.toString(arr));
        }
    }
}

 

[0, 1, 1, 0, 0]
[1, 0, 1, 0, 1]
[1, 1, 0, 1, 0]
[0, 0, 1, 0, 1]
[0, 1, 0, 1, 0]