快速入门案例

代码实现

package com.atguigu.graph;import java.util.ArrayList;
import java.util.Arrays;/*** @创建人 wdl* @创建时间 2021/4/2* @描述*/
public class Graph {private ArrayList<String> vertexList;//存储顶点集合private int[][] edges;//存储图对应的邻接矩阵private int numOfEdges;//表示边的数目public static void main(String[] args) {//测试一把图是否创建OKint n=5;//节点的个数String Vertexs[]={"A","B","C","D","E"};//创建图对象Graph graph = new Graph(n);//循环的添加顶点for(String vertex:Vertexs){graph.insertVertex(vertex);}//添加边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();}//构造器public Graph(int n) {//初始化矩阵和vertexListedges = 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 int getNumOfEdges(){return numOfEdges;}//返回节点i(下标)对应的数据public String getValueByIndex(int i){return vertexList.get(i);}//返回v1和v2的权值public int getWeight(int v1,int v2){return edges[v1][v2];}//插入节点public void insertVertex(String vertex){vertexList.add(vertex);}//添加边/**** @param v1 表示点的下标是第几个顶点 "A"-"B"  "A"->0 "B"->1* @param v2 第二个顶点对应的下标* @param weight*/public void insertEdge(int v1,int v2,int weight){edges[v1][v2]=weight;edges[v2][v1]=weight;numOfEdges++;}}