【最短路+路径记录】hdu-1142

#include <cstdio>
#include <cstring>

int n ;
int map[1010][1010] , dist[1010] , dp[1010];
const int maxn = 5000000 ;

void dij(int v)  //dijsktra  算法   求到v点的最短路
{
int i , j , mins , index;
int vis[1010];
for(i = 1 ; i <= n ; i++)
    {
        dist[i] = map[i][v];
        vis[i] = 0;
    }
    dist[v] = 0;
    vis[v] = 1;
for(i = 1 ; i < n ; i++)
    {
        mins = maxn;
for(j = 1 ; j <= n ; j++)
        {
if(!vis[j] && dist[j] < mins)
            {
                mins = dist[j];
                index = j;
            }
        }
if(mins == maxn)
break;
        vis[index] = 1;
for(j = 1 ; j <= n ; j++)
        {
if(!vis[j] && dist[j] > dist[index] + map[j][index])
                dist[j] = dist[index] + map[j][index];
        }
    }
}

int dfs(int v)
{
if(dp[v] != -1)
return dp[v];
if(v == 2)
return 1;
int i , temp , sum = 0;
for(i = 1 ; i <= n ; i++)
    {
if(map[v][i] != maxn && dist[v] > dist[i])
        {
            temp = dfs(i);
            sum += temp;
        }
    }
    dp[v] = sum;
return sum;
}

int main()
{
while(scanf("%d",&n) && n)
    {
int i , j , d , m;
        scanf("%d",&m);
for(i = 1 ; i <= n ; i++)
        {
            dp[i] = -1;
for(j = 1 ; j <= n ; j++)
                map[i][j] = maxn;
        }
while(m--)
        {
            scanf("%d%d%d",&i,&j,&d);
            map[i][j] = map[j][i] = d;
        }
        dij(2);
        dfs(1);
        printf("%d\n",dp[1]);
    }
return 0;
}

转载于:https://www.cnblogs.com/zuckerTT/archive/2011/10/17/2215441.html