SYSTEM
图
src/content/notes/system/图.md 图
图的邻接表形式:
public class AGraph {
private VertexNode[] adjList; //邻接数组
private int vLen, eLen; //顶点数和边数
public AGraph(int vLen, int eLen) {
this.vLen = vLen;
this.eLen = eLen;
adjList = new VertexNode[vLen];
}
//弧节点
private class ArcNode {
int adjVex; //该边所指向的顶点的位置
ArcNode nextArc; //下一条边(弧)
//int info //添加权值
public ArcNode(int adjVex) {
this.adjVex = adjVex;
nextArc = null;
}
}
//表顶点
private class VertexNode {
char data; //顶点信息
ArcNode firstArc; //指向第一条边的指针
public VertexNode(char data) {
this.data = data;
firstArc = null;
}
}
}
图的邻接矩阵形式:
public class MGraph {
private int[][] edges; //邻接矩阵定义,有权图将int改为float
private int vLen; //顶点数
private int eLen; //边数
private VertexNode[] vex; //存放节点信息
public MGraph(int vLen, int eLen) {
this.vLen = vLen;
this.eLen = eLen;
this.edges = new int[vLen][vLen];
this.vex = new VertexNode[vLen];
}
private class VertexNode {
int num; //顶点编号
String info; //顶点信息
public VertexNode(int num) {
this.num = num;
this.info = null;
}
}
}
图相关的算法需要很多的流程图,此处不再一一列举,推荐参考书籍《数据结构高分笔记》