zoukankan      html  css  js  c++  java
  • 最小生成树 B

    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
    
    0

    Sample Output

    0
    17
    16
    26
    #include<iostream>
    #include<string>
    #include<algorithm>
    #include<cstdio>
    #include<cstring>
    using namespace std;
    #define MAXN 55
    #define INF 0x3f3f3f3f
    bool been[MAXN];
    int n,m,g[MAXN][MAXN],lowcost[MAXN];
    int Prim(int beg)
    {
        memset(been,false,sizeof(been));
        for(int i=1;i<=n;i++)
        {
            lowcost[i] = g[beg][i];
        }
        been[beg] = true;
        int ans = 0;
        for(int j=1;j<n;j++)
        {
            int Minc = INF,k=-1;
            for(int i=1;i<=n;i++)
            {
                if(!been[i]&&lowcost[i]<Minc)
                {
                    Minc = lowcost[i];
                    k = i;
                }
            }
            if(k==-1) return -1;
            been[k] = true;
            ans+=Minc;
            for(int i=1;i<=n;i++)
            {
                if(!been[i]&&lowcost[i]>g[k][i])
                {
                    lowcost[i] = g[k][i];
                }
            }
        }
        return ans;
    }
    int main()
    {
        while(scanf("%d",&n),n)
        {
            scanf("%d",&m);
            for(int i=1;i<=n;i++)
                for(int j=1;j<=n;j++)
                {
                    g[i][j] = INF;
                }
            for(int i=0;i<m;i++)
            {
                int x,y,d;
                scanf("%d%d%d",&x,&y,&d);
                g[x][y] = min(g[x][y],d);
                g[y][x] = min(g[y][x],d);
            }
            int ans = Prim(1);
            cout<<ans<<endl;
        }
    }
  • 相关阅读:
    zendstudio 默认网页打开your project的时候不显示本地主机localhost的解决方法
    centos安装epel源后,使用报错(Error: Cannot retrieve repository metadata (repomd.xml) for repository: epel. Please verify its path and try again)
    描述硬链接和软链接区别
    软硬链接和文件之间的关系
    硬链接 inode号码相同 文件名不同
    目录下没有任何内容,为什么该目录的硬链接数为何是2
    磁盘还有空间为什么不能写入数据以及彻底删除文件原理
    inode和block的关系
    block
    /etc/init.d和/etc/rc.d/rc*.脚本/etc/rc.d/rc.local和/etc/rc.d/rc.sysinit
  • 原文地址:https://www.cnblogs.com/joeylee97/p/6589492.html
Copyright © 2011-2022 走看看