import java.util.ArrayList;
import java.util.Arrays;
public class GraphDemo {
private ArrayList<String> vertexList; //存储顶点的集合
private int[][] edges; //邻接矩阵
private int numOfEdges; //边的个数
public static void main(String[] args) {
String[] vertex = {"A", "B", "C", "D", "E"};
int len = vertex.length;
GraphDemo graph = new GraphDemo(len);
//添加顶点
for (int i = 0; i < len; i++) {
graph.insertVertex(vertex[i]);
}
//添加边
/*
B - -E
/ | \
/ | \
C - A D
*/
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 GraphDemo(int num) {
vertexList = new ArrayList<>(num);
edges = new int[num][num];
numOfEdges = 0;
}
/**
* 获取边的个数
* @return
*/
public int getNumOfEdges() {
return numOfEdges;
}
/**
* 获取顶点的个数
* @return
*/
public int getNumOfVertex() {
return vertexList.size();
}
/**
* 获取权重
* @param v1
* @param v2
* @return
*/
public int getWeight(int v1, int v2) {
return edges[v1][v2];
}
/**
* 通过下标获取值
* @param index
* @return
*/
public String getValueByIndex(int index) {
return vertexList.get(index);
}
/**
* 插入顶点
* @param vertex 顶点
*/
public void insertVertex(String vertex) {
vertexList.add(vertex);
}
/**
* 插入边
* @param v1 顶点的下标
* @param v2 顶点的下标
* @param weight 权重
*/
public void insertEdges(int v1, int v2, int weight) {
edges[v1][v2] = weight;
edges[v2][v1] = weight;
numOfEdges++;
}
/**
* 展示图
*/
public void showGraph() {
for(int[] row : edges) {
System.err.println(Arrays.toString(row));
}
}
}
图-代码实现
最新推荐文章于 2023-05-03 23:43:23 发布