随笔分类 -  最短路径算法

摘要：#include"stdio.h"#defineBIG9999//无穷大//Dijkstra算法函数，求给定顶 点到其余各点的最短路径//参数：邻接矩阵、顶点数、出发点的下标、结果数组voidDijkstra(intCost[] [6],intn,intv0,intDistance[]){ints[6];intmindis,dis;inti,j,u;//初始化for(i=0;i<n;i++){Distance[i]=Cost[v0][i];s[i]=0;}s[v0] =1;/*标记v0*///在当前还未找到最短路径的顶点中，//寻找具有最短距离的顶点for(i=1;i 阅读全文

摘要：PublicFunctionshortpath(startnoAsInteger,endnoAsInteger)AsSingle以开始点，结束点为参数。Dimresult()AsSingleDimresult1AsInteger定义结果点Dims1AsSingleDimminAsSingleDimii,i,j,aaAsIntegerDimyc()AsBooleanDimycd()AsBooleanDimrs1()AsSingleDimno()AsIntegerDimnopointAsIntegerReDimyc(1Tomaxno)AsBooleanReDimycd(1Tomaxno)AsBoo 阅读全文