数据结构之图的创建（邻接矩阵存储）

package com.haiyang.datastructure.graph;

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

/**
 * 图的初始化
 *
 * @author haiYang
 * @create 2022-01-23 16:06
 */
public class GraphDemo {
    public static void main(String[] args) {
        int n = 5;
        String[] vertexValues = new String[]{"A", "B", "C", "D", "E"};
        Graph graph = new Graph(n);
        for (String vertex : vertexValues) {
        	//添加顶点
            graph.insertVertex(vertex);
        }
        //添加边
        //ABCDE 对应索引 0-4
        graph.insertEdge(0, 1, 1);
        graph.insertEdge(0, 2, 1);
        graph.insertEdge(1, 2, 1);
        graph.insertEdge(1, 3, 1);
        graph.insertEdge(1, 4, 1);
        graph.showGraph();


    }
}

//图类 无向图举例
class Graph {
    private ArrayList<String> vertexList;//存储顶点的集合
    private int[][] edges;//存储图对应的邻接矩阵
    private int numOfEdges;//表示边的个数

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

    //获取顶点个数
    public int getNumOfVertex() {
        return vertexList.size();
    }

    //显示邻接矩阵
    public void showGraph() {
        for (int[] link : edges) {
            System.out.println(Arrays.toString(link));
        }
    }

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

    //添加边   v1、v2：代表顶点， weight：边的权值 
    public void insertEdge(int v1, int v2, int weight) {
        edges[v1][v2] = weight;
        edges[v2][v1] = weight;
        numOfEdges++;
    }
}