您现在的位置是：首页 > 后台技术 > 数据结构与算法数据结构与算法

图的创建(图文)

第十三双眼睛2023-10-22【数据结构与算法】人已围观

简介图的创建

图的创建

package com.xingchen.day015;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
public class Graph {
private int[][] edges;//邻结矩阵
private int numOfEdges;//边
private List<String> vertexList;//顶点集合
public static void main(String[] args) {
//测试
int n = 5; //节点得个数
String[] vertex = {"a", "b", "c", "d", "e"};
Graph graph = new Graph(5);
for (String value : vertex) {
graph.insert(value);
}
//添加边
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();
}
public Graph(int n) {
this.edges = new int[n][n];
vertexList = new ArrayList<>(n);
numOfEdges = 0;
}
public void insert(String vertex) {
vertexList.add(vertex);
}
//添加边
public void insertEdges(int v1,int v2,int weight) {
edges[v1][v2] = weight;
edges[v2][v1] = weight;
numOfEdges ++;
}
public int getNumOfvertex() {
return vertexList.size();
}
public int getNumOfEdges() {
return numOfEdges;
}
//返回节点对应得数据
public String getValueByIndex(int i) {
return vertexList.get(i);
}
public int getWeight(int v1,int v2) {
return edges[v1][v2];
}
//显示图对应得矩阵
public void showGraph() {
for (int[] link: edges) {
System.out.println(Arrays.toString(link));
}
}
}

Tags：

很赞哦！ ()

上一篇：平衡二叉树(图文)

下一篇：图的遍历(图文)