package temp;
import java.util.Scanner;
public class Test { //图的深度优先遍历(图的存储基于邻接表)
public static void main(String[] args) {
String[] arr = {"a","b","c","d","e"};
MGraph mg = new MGraph(arr, 5, 5); //5个顶点5条边
mg.DFSTraverse(3); //从"d"开始遍历
}
}
class MGraph {
final int MaxSize = 10; //图中顶点的最多个数
private int vertexNum,arcNum; //图的顶点数和边数
private String[] vertex = new String[MaxSize]; //存放顶点内容的数组
private int[][] arc = new int[MaxSize][MaxSize]; //存放边的数组
private int[] visited = new int[MaxSize]; //存放每个顶点被访问情况
public int getVertexNum() { //获取顶点数
return vertexNum;
}
public void setVertexNum(int vertexNum) { //设置顶点数
this.vertexNum = vertexNum;
}
public int getArcNum() { //获取边数
return arcNum;
}
public void setArcNum(int arcNum) { //设置边数
this.arcNum = arcNum;
}
public String[] getVertex() { //获取顶点数组
return vertex;
}
public void setVerte
基于邻接矩阵存储的图的深度优先遍历代码(Java语言实现)
最新推荐文章于 2023-03-14 09:33:55 发布
本文介绍了如何使用Java编程语言,通过邻接矩阵来实现图的深度优先遍历。提供了详细的代码实现,并附有运行截图,帮助读者理解算法的实际应用。
摘要由CSDN通过智能技术生成