模板_Dijkstra最短路径算法

//初始化dis数组，这里是1号顶点到其余各个顶点的初始路程 
for(i = 1;i <= n;i ++)
   dis[i]=e[1][i];
 
   book[1]=1;
//Dijkstra算法核心语句
  for(i = 1;i <= n-1;i ++)
  {
  	min = inf;
  	
  	for(j = 1;j <= n;j ++)
  	{
  		if(!book[j] && dis[j] < min)
  		{
  			min = dis[j];
  			u = j;
  			
  		}
  	}
  	book[u]=1;
  	
  	for(v = 1;v <= n;v ++)
  	{
  		if(e[u][v]<inf)
  		{
  			if(dis[v]>dis[u]+e[u][v])
  			    dis[v]=dis[u]+e[u][v];
  		}
  	}
  }