最短路径(7)--poj1502(最短路径模板题)

最新推荐文章于 2022-05-18 01:11:06 发布

原创最新推荐文章于 2022-05-18 01:11:06 发布 · 1.3k 阅读

3 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#单源最短路径 #dijkstra #poj1502

【最短路径】专栏收录该内容

12 篇文章

订阅专栏

该博客介绍了一道POJ1502题目，涉及单源最短路径问题。给定一个不完全的矩阵，用Dijkstra算法求解从点1出发到其他点的最短路径中最大花费的时间。文章提供了问题描述、输入输出格式、示例以及解决方案代码。

MPI Maelstrom

Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%lld & %llu

Description

BIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Odyssey distributed shared memory machine with a hierarchical communication subsystem. Valentine McKee's research advisor, Jack Swigert, has asked her to benchmark the new system.
``Since the Apollo is a distributed shared memory machine, memory access and communication times are not uniform,'' Valentine told Swigert. ``Communication is fast between processors that share the same memory subsystem, but it is slower between processors that are not on the same subsystem. Communication between the Apollo and machines in our lab is slower yet.''

``How is Apollo's port of the Message Passing Interface (MPI) working out?'' Swigert asked.

``Not so well,'' Valentine replied. ``To do a broadcast of a message from one processor to all the other n-1 processors, they just do a sequence of n-1 sends. That really serializes things and kills the performance.''

``Is there anything you can do to fix that?''

``Yes,'' smiled Valentine. ``There is. Once the first processor has sent the message to another, those two can then send messages to two other hosts at the same time. Then there will be four hosts that can send, and so on.''

``Ah, so you can do the broadcast as a binary tree!''

``Not really a binary tree -- there are some particular features of our network that we should exploit. The interface cards we have allow each processor to simultaneously send messages to any number of the other processors connected to it. However, the messages don't necessarily arrive at the destinations at the same time -- there is a communication cost involved. In general, we need to take into account the communication costs for each link in our network topologies and plan accordingly to minimize the total time required to do a broadcast.''

Input

The input will describe the topology of a network connecting n processors. The first line of the input will be n, the number of processors, such that 1 <= n <= 100.

The rest of the input defines an adjacency matrix, A. The adjacency matrix is square and of size n x n. Each of its entries will be either an integer or the character x. The value of A(i,j) indicates the expense of sending a message directly from node i to node j. A value of x for A(i,j) indicates that a message cannot be sent directly from node i to node j.

Note that for a node to send a message to itself does not require network communication, so A(i,i) = 0 for 1 <= i <= n. Also, you may assume that the network is undirected (messages can go in either direction with equal overhead), so that A(i,j) = A(j,i). Thus only the entries on the (strictly) lower triangular portion of A will be supplied.

The input to your program will be the lower triangular section of A. That is, the second line of input will contain one entry, A(2,1). The next line will contain two entries, A(3,1) and A(3,2), and so on.

Output

Your program should output the minimum communication time required to broadcast a message from the first processor to all the other processors.

Sample Input

Sample Output

Hint

这道题题意：给你一个不完全的矩阵，数字表示权值，x表示两点间不可达，由于自身到自身花费的时间为0，所以没有给出，由于i到j和j到i距离相同，互达时间相同，所以只给出了一半的临界矩阵。
根据给你的这个临界矩阵，让你来求从点1到其他点所花费最短时间集里面的的最大值。
其实这是一个很直接的最短路，代码如下：

#include <iostream>  
#include<stdio.h>
#include <string.h>  
#include <stdlib.h>
using namespace std;  
#define MAXV 102  
#define INF 100000  
  
int map[MAXV][MAXV],n;  
  
void dijstra(){  
    int i,j,ans=-1,min,v;  
    int d[MAXV],vis[MAXV];  
    //d数组表示从原点到i点的最短距离  
    //vis用于表达这个点是否已经被选中  
    for(i=1;i<=n;i++){  
        d[i]=INF;  
        vis[i]=0;  
    }  
    d[1]=0;     //因为start到start的距离为0，这里源点为1  
  
    for(i=1;i<=n;i++){  
        min=INF;  
        for(j=1;j<=n;j++){       //每次找点的过程，首先这个点没有被发现，然后找一个最小点  
            if(!vis[j] && d[j]<min){  
                min=d[j];  
                v=j;  
            }  
        }  
        //这里为什么找的最小的边就一定是最短路呢  
        //因为一个图要连通起来，就必须有一条边和已知点集连起来，所以找的最小的未知点必是最短路  
        vis[v]=1;  
  
        for(j=1;j<=n;j++)        //加进最小点后，再修改从源点没有被发现的点的最短路径  
            if(!vis[j] && d[v]+map[v][j]<d[j])  
                d[j]=d[v]+map[v][j];  
    }  
  
    for(i=2;i<=n;i++)  
        if(d[i]>ans) ans=d[i];  
    printf("%d\n",ans);  
}  
  
int main(){  
    char s[10];  
    int i,j;  
    while(~scanf("%d\n",&n)){  
        for(i=1;i<=n;i++)  
            for(j=1;j<=n;j++)  
                if(i!=j)  
                    map[i][j]=INF;  
                else  
                    map[i][j]=0;  
        for(i=2;i<=n;i++)  
            for(j=1;j<i;j++){  
                scanf("%s",s);  
                if(s[0]!='x')  
                    map[i][j]=map[j][i]=atoi(s);    //将字符串转换为数字  
            }  
        dijstra();  
    }  
      
    return 0;  
}