迪杰斯特拉算法寻找最短路由(java版).docVIP

测试目的：寻找目的路由器的最短路径算法 算法语言：JAVA 算法原理：迪杰斯特拉最短路径算法 运行环境：eclipse 第一部分 矩阵图创建 package mesopotamia.android; //创建矩阵图 public class AdjMWGraph{ static final int maxWeight = 10000; private SeqList vertices; //存储结点的顺序表 private int[][] edge; //存储边的二维数组 private int numOfEdges; //边的个数 public AdjMWGraph(int maxV){ //构造函数，maxV为结点个数 vertices = new SeqList(maxV); edge = new int[maxV][maxV]; for(int i = 0; i maxV; i ++){ for(int j = 0; j maxV; j ++){ if(i == j) edge[i][j] = 0; else edge[i][j] = maxWeight; } } numOfEdges = 0; } public int getNumOfVertices(){ //返回结点个数 return vertices.size; } public int getNumOfEdges(){ //返回边的个数 return numOfEdges; } public Object getValue(int v) throws Exception{ //返回结点v的数据元素 return vertices.getData(v); } public int getWeight(int v1, int v2) throws Exception{ //返回边v1,v2的权值 if(v1 0 || v1 = vertices.size || v2 0 || v2 = vertices.size) throw new Exception(参数v1或v2越界出错！); return edge[v1][v2]; } public void insertVertex(Object vertex) throws Exception{ //插入结点 vertices.insert(vertices.size, vertex); } public void insertEdge(int v1, int v2, int weight) throws Exception{ //插入边v1,v2，权值为weight if(v1 0 || v1 = vertices.size || v2 0 || v2 = vertices.size) throw new Exception(参数v1或v2越界出错！); edge[v1][v2] = weight; //置边的权值 numOfEdges ++; //边的个数加1 } public void deleteEdge(int v1, int v2) throws Exception{ //删除边v1,v2 if(v1 0 || v1 vertices.size || v2 0 || v2 vertices.size) throw new Exception(参数v1或v2越界出错！); if(edge[v1][v2] == maxWeight || v1 == v2) throw new Exception(该边不存在！); edge[v1][v2] = maxWeight; //置边的权值为无穷大 numOfEdges --; //边的个数减1 } public int getFirstNeighbor(int v) throws Exception{ //取结点v的第一个邻接结点。若存在返回该结点的下标序号，否则返回-1 if(v 0 || v = vertices.size) throw new Exception(参数v越界出错！); for(int col = 0; col vertices.size; col ++) if(edge[v][col] 0 edge[v][co