HDU 1301 Jungle Roads

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1301

给出一幅图，求最小生成树。

prim+优先队列

#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<cstdio>
#include<cstring>
#define LL long long
using namespace std;
const int maxn=30,inf=1<<30;
using namespace std;
int d[maxn],vis[maxn];
struct edge
{
    int to,len;
    edge(int to,int len):to(to),len(len){}
};
struct node
{
    int v,dist;
    node(int x,int y):v(x),dist(y){}
    friend bool operator <(node a,node b)
    {
        return a.dist>b.dist;
    }
};
vector<edge>G[maxn];
int prim()
{
    int ans=0;
    fill(vis,vis+maxn,0);
    fill(d,d+maxn,inf);
    priority_queue<node>q;
    q.push(node(0,0));
    while(q.size())
    {
        node t=q.top();q.pop();
        if(vis[t.v]) continue;
        vis[t.v]=1;
        ans+=t.dist;
        for(int i=0;i<G[t.v].size();i++)
        {
            edge e=G[t.v][i];
            if(vis[e.to]) continue;
            if(e.len<d[e.to]) d[e.to]=e.len,q.push(node(e.to,e.len));
        }
    }
    return ans;
}
int main()
{
    int n,w,op,from,to;
    char s,e;
    while(cin>>n,n)
    {
        for(int i=0;i<=n;i++) G[i].clear();
        for(int i=0;i<n-1;i++)
        {
            cin>>s>>op;
            from=s-'A';
            for(int j=0;j<op;j++)
            {
                cin>>e>>w;
                to=e-'A';
                G[from].push_back(edge(to,w));
                G[to].push_back(edge(from,w));
            }
        }
        cout<<prim()<<endl;
    }
    return 0;
}