POJ 2387 Til the Cows Come Home dijkstra算法 用邻接表和邻接矩阵

题目如下：

Til the Cows Come Home
Time Limit: 1000MS        Memory Limit: 65536K
Total Submissions: 27726        Accepted: 9353

Description
Bessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her

for the morning milking. Bessie needs her beauty sleep, so she wants to get back as quickly as possible.

Farmer John's field has N (2 <= N <= 1000) landmarks in it, uniquely numbered 1..N. Landmark 1 is the barn; the apple tree

grove in which Bessie stands all day is landmark N. Cows travel in the field using T (1 <= T <= 2000) bidirectional cow-

trails of various lengths between the landmarks. Bessie is not confident of her navigation ability, so she always stays on

a trail from its start to its end once she starts it.

Given the trails between the landmarks, determine the minimum distance Bessie must walk to get back to the barn. It is

guaranteed that some such route exists.

Input
* Line 1: Two integers: T and N

* Lines 2..T+1: Each line describes a trail as three space-separated integers. The first two integers are the landmarks

between which the trail travels. The third integer is the length of the trail, range 1..100.

Output
* Line 1: A single integer, the minimum distance that Bessie must travel to get from landmark N to landmark 1.

Sample Input

5 5
1 2 20
2 3 30
3 4 20
4 5 20
1 5 100

Sample Output

90

Hint
INPUT DETAILS:

There are five landmarks.

OUTPUT DETAILS:

Bessie can get home by following trails 4, 3, 2, and 1.

求最短路，经典的dijkstra算法直接解决了，分别用邻接表和邻接矩阵存图。

邻接矩阵版：

#include 
   
   
    
    
#include
    
    
     
     
using namespace std;
int Map[1005][1005];
int const MAXV=10000;

void dijkstra(int m,int k,int n)
{
    int i,j,Min,v;
    int d[MAXV];
    bool vis[MAXV];

    for(i=1; i<=n; i++)
    {
        vis[i]=0;
        d[i]=Map[m][i];
    }

    for(i=1; i<=n; i++)
    {
        Min=0x3f3f3f3f;
        for(j=1; j<=n; j++)
            if(!vis[j] && d[j]
     
     
      
      Map[v][j]+d[v])
                d[j]=Map[v][j]+d[v];
    }
    cout<
      
      
       
       <
       
       
         w) Map[v][u]=Map[u][v]=w; } dijkstra(N,1,N); } return 0; } 
       
      
      
     
     
    
    
   
   

邻接表版：

#include 
    
    
     
     
#include
     
     
      
      
#include
      
      
       
       
#include
       
       
        
        
int const MAX_M=100000;
using namespace std;
struct Edge
{
    int target;
    int weight;
    Edge *nxt;
    Edge() {}
    Edge(int a, int b, Edge *n): target(a), weight(b), nxt(n) {}
}*head[10000], EdgePool[MAX_M], *ptr = EdgePool;

void AddEdge(int u, int v, int w)
{
    head[u] = new(ptr++) Edge(v, w, head[u]);
}
int f[1005],d[1005];
void Dijkstra(int S,int n)
{
    memset(d, 0x3f, sizeof d);
    memset(f, 0, sizeof f);
    d[S] = 0;
    for (int i = 1, min_p = 0x3f3f3f3f, min_v; i <=n; ++i, min_p = 0x3f3f3f3f)
    {
        for (int j = 1; j <= n; ++j)
            if (!f[j] && d[j] < min_p)
                min_p = d[j], min_v = j;
        f[min_v] = true;
        for (Edge *p = head[min_v]; p; p = p->nxt)
            d[p->target] = min(d[p->target], d[min_v] + p->weight);
    }
}
int main()
{
    int T,N;
    ptr = EdgePool;
    while(~scanf("%d%d",&T,&N))
    {
        memset(head, 0, sizeof head);
        ptr = EdgePool;

        while (T--)
        {

            bool flag=false;
            int u,v,w;
            scanf("%d%d%d",&u,&v,&w);
            for (Edge *p = head[u]; p; p = p->nxt)
            {
                if(p->target==v)
                {
                    if(p->weight>w)
                        p->weight=w;
                    flag=true;
                    break;
                }
            }
            if(!flag)
                AddEdge(u,v,w);
            flag=false;
            for (Edge *p = head[v]; p; p = p->nxt)
            {
                if(p->target==u)
                {
                    if(p->weight>w)
                        p->weight=w;
                    flag=true;
                    break;
                }
            }
            if(!flag)
                AddEdge(v,u,w);


        }
        Dijkstra(N,N);
        cout<
        
        
          <