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
5
50
30 5
100 20 50
10 x x 10
Sample Output
35
题意：给出一个三角阵，代表mp[2][1],mp[3][1]，mp[3][2]....的值，即2-->1的权值为三角阵该位置的值,求最短路径中最大的权值为多少，模板题，spfa算法如下：
第一种：链式前向星存储（邻接表），耗时16ms：
//
// Created by hanyu on 2019/7/20.
//
#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
const int maxn=205;
#define MAX 0x3f3f3f3f
int T;
int d[maxn],head[maxn];//当时把head初始化赋值了，导致一直错，输出数据无穷大，就因为这个一下午就没了。。。所以无需赋值
int pos,n;
struct Node{
int w;
int t;
int next;
}node[maxn*maxn];
void add(int u,int v,int w)
{
node[pos].w=w;
node[pos].t=v;
node[pos].next=head[u];
head[u]=pos++;
}
void spfa()
{
memset(d,MAX,sizeof(d));
queue<int>qu;
qu.push(1);
d[1]=0;
while(!qu.empty())
{
int now=qu.front();
qu.pop();
for(int i=head[now];i;i=node[i].next)
{
if(d[node[i].t]>d[now]+node[i].w)
{
d[node[i].t]=d[now]+node[i].w;
qu.push(node[i].t);
}
}
}
}
int main() {
scanf("%d", &n);
pos = 0;
char str[100];
for (int i = 2; i <= n; i++) {
for (int j = 1; j < i; j++) {
scanf("%s", str);
if (str[0] != ‘x‘) {
add(i, j, atoi(str));
add(j, i, atoi(str));
}
}
}
spfa();
int ma=0;
for(int i=1;i<=n;i++)
{
ma=max(ma,d[i]);
}
printf("%d\n",ma);
return 0;
}
第二种：本题数据范围不大，可以直接采用邻接矩阵存储图，同样耗时16s：
//
// Created by hanyu on 2019/7/20.
//
#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
const int maxn=105;
#define MAX 0x3f3f3f3f
int road[maxn][maxn];
int book[maxn];
int d[maxn];
int n;
void spfa(int s)
{
memset(book,0,sizeof(book));
memset(d,MAX,sizeof(d));
queue<int>qu;
qu.push(s);
book[s]=1;
d[s]=0;
while(!qu.empty())
{
int now=qu.front();
qu.pop();
book[now]=0;
for(int i=1;i<=n;i++)
{
if(d[i]>d[now]+road[now][i])
{
d[i]=d[now]+road[now][i];
if(!book[i])
{
qu.push(i);
book[i]=1;
}
}
}
}
}
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
for(int j=0;j<=i;j++)
{
if(i==j)
road[i][j]=0;
else
road[i][j]=road[j][i]=MAX;
}
}
for(int i=2;i<=n;i++)
{
for(int j=1;j<i;j++)
{
char str[100];
scanf("%s",str);
if(str[0]!=‘x‘)
{
road[i][j]=road[j][i]=atoi(str);
}
}
}
spfa(1);
int ma=0;
for(int i=1;i<=n;i++)
{
ma=max(ma,d[i]);
}
printf("%d\n",ma);
return 0;
}
