#include <vector>
using namespace std;
typedef struct edge
{
int v;
int w;
}edge;
#define narray 1001
const int maxData = 0x7fffffff;
vector<edge> adj[narray]; //邻接表
int m,n; //m为边数,n为顶点数
int d[narray];
bool final[narray];
void Dij(int src)
{
int i,j;
int mintemp,v;
for(i=1;i<=n;++i) d[i] = maxData; //此处将除源点以外的所有点的距离设置成无穷大
d[src] = 0;
memset(final,0,sizeof(final)); //注意此处将所有的点(包括源点)设置为false,因为d[]距离没有进行初始化(即赋值为源点的距离)
for(i=1;i<n;++i)
{
mintemp = maxData;
v = -1;
for(j=1;j<=n;++j)
{
if(!final[j] && d[j]<mintemp)
{
v = j;
mintemp = d[j];
}
}
if(v==-1) break; //此处进行了优化
final[v] = true;
for(j=0;j<adj[v].size();++j) //遍历v的邻接表
{
int tempv = adj[v][j].v;
int tempw = adj[v][j].w;
if(d[tempv]>d[v]+tempw)
{
d[tempv] = d[v]+tempw;
}
}
}
}
int main()
{
int i,j;
int start,end,weight;
edge tempedge;
while(scanf("%d%d",&m,&n)!=-1)
{
for(i=1;i<=m;++i)
{
scanf("%d%d%d",&start,&end,&weight);
tempedge.v = end;
tempedge.w = weight;
adj[start].push_back(tempedge);
tempedge.v = start;
adj[end].push_back(tempedge);
}
}
return 0;
}
转载于:https://www.cnblogs.com/north_dragon/archive/2010/06/05/1752428.html