acm pku 1287 Networking的Prim最小生成树算法实现

最新推荐文章于 2021-08-01 08:49:05 发布

uestcshe

最新推荐文章于 2021-08-01 08:49:05 发布

阅读量883

点赞数

分类专栏： acm 文章标签： networking 算法 numbers each iostream network

本文链接：https://blog.csdn.net/uestcshe/article/details/6079077

版权

acm 专栏收录该内容

30 篇文章 0 订阅

订阅专栏

Networking

Description

You are assigned to design network connections between certain points in a wide area. You are given a set of points in the area, and a set of possible routes for the cables that may connect pairs of points. For each possible route between two points, you are given the length of the cable that is needed to connect the points over that route. Note that there may exist many possible routes between two given points. It is assumed that the given possible routes connect (directly or indirectly) each two points in the area.
Your task is to design the network for the area, so that there is a connection (direct or indirect) between every two points (i.e., all the points are interconnected, but not necessarily by a direct cable), and that the total length of the used cable is minimal.

Input

The input file consists of a number of data sets. Each data set defines one required network. The first line of the set contains two integers: the first defines the number P of the given points, and the second the number R of given routes between the points. The following R lines define the given routes between the points, each giving three integer numbers: the first two numbers identify the points, and the third gives the length of the route. The numbers are separated with white spaces. A data set giving only one number P=0 denotes the end of the input. The data sets are separated with an empty line.
The maximal number of points is 50. The maximal length of a given route is 100. The number of possible routes is unlimited. The nodes are identified with integers between 1 and P (inclusive). The routes between two points i and j may be given as i j or as j i.

Output

For each data set, print one number on a separate line that gives the total length of the cable used for the entire designed network.

Sample Input

1 0

2 3

1 2 37

2 1 17

1 2 68

3 7

1 2 19

2 3 11

3 1 7

1 3 5

2 3 89

3 1 91

1 2 32

5 7

1 2 5

2 3 7

2 4 8

4 5 11

3 5 10

1 5 6

4 2 12

Sample Output

Source

Southeastern Europe 2002

分析：题目大意是找到联通所有节点且具有最小路径和的方案，并返回最小路径和，归根结底，这又是一道最小生成树的问题。Prim最小生成树算法是一个很好的选择。

在代码实现时，由于同样的路径具有多种不同的权重，因此，需要存储具体两节点间的最小路径权重，Prim算法的基本思想是：先找出整个网络中，具有最小节点路径的两个点，构成一个包，这后不断从网络中向这个保重加入节点，知道所有网络中的节点都加入该包为止。在将节点加入包时，始终选择当前网络中到包距离最近的节点加入。

代码实现：

#include <string.h>

#include "iostream"

using namespace std;

#define N 51

int itg[N][N];

int PrimTree( int P )

{

bool bflag[N];

int res = 0;

int i, j, k, imin, index[2];

memset( bflag, false, sizeof(bool)*N );