图的两种表现形式:
- 数组表示:邻接矩阵
- 链表表示:邻接表
package com;
import java.util.Arrays;
public class Graph {
public static void main(String[] args) {
int n=5; //节点个数
char vertex[]={'A','B','C','D','E'};
//创建一个图
Graph graph=new Graph(vertex);
//添加边
graph.insertEdges(0,1,1);
graph.insertEdges(0,2,1);
graph.insertEdges(1,2,1);
graph.insertEdges(1,3,1);
graph.insertEdges(1,4,1);
graph.showGraph();
}
char[] vertex;
int[][] edges;
//初始化
public Graph(char[] vertex){
//初始化矩阵和顶点
edges=new int[vertex.length][vertex.length];
this.vertex&