poj1502迪杰斯特拉模板题

无向图的最短路问题，直接上模板可解。
唯一的问题是输入稍有些麻烦。
用stringstream ss;
string s;
getline(cin,s);
ss.str(s);
可以解决
详情见http://www.ysg.name/?p=12

#include <cstdio>
#include <cstring>
#include <sstream>
#include <string>
#include <iostream>
#define INF 0x3f3f3f3f
using namespace std;
const int MAXN = 110;
int d[MAXN],cost[MAXN][MAXN];
int vis[MAXN],N;
void dijkstra(int s){
    memset(d,INF,sizeof(d));
    memset(vis,0,sizeof(vis));
    d[s]=0;
    while(true){
        int v=-1;
        for (int u = 1; u <=N ; ++u){   if(!vis[u]&&(v==-1||d[u]<d[v])){    v=u;    }   }
        if(v==-1){ break;}
        vis[v]=1;
        for (int i = 1; i <=N ; ++i)
        {
            d[i]=min(d[i],d[v]+cost[v][i]);
        }
    }
}
int main(int argc, char const *argv[])
{
    while(scanf("%d",&N)!=EOF){
        stringstream ss;
        string s;
        memset(cost,INF,sizeof(cost));
        cost[1][1]=0;
        getline(cin,s);
        for (int i = 2; i <= N ; ++i)
        {
            cost[i][i]=0;
            int cur=1;
            s.clear();
            getline(cin, s);
            ss.clear();
            ss.str(s);
            while (1)
            {
                char tmp[20];
                ss >> tmp;
                if ( ss.fail() ){ break;    }
                int num=strlen(tmp);
                if(tmp[0]>'9'){
                    cur++;
                    continue;
                }else{
                    int sum=0,oper=1;
                    for (int j = num-1; j >=0 ; --j)
                    {
                        sum+=(tmp[j]-'0')*oper;
                        oper*=10;
                    }
                    cost[i][cur]=cost[cur][i]=sum;
                }
                cur++;

            }
        }
        dijkstra(1);
        int path=0;
        for (int i = 1; i <=N ; ++i)
        {
            path=max(path,d[i]);
        }
        printf("%d\n",path);
    }
    return 0;
}