最小生成树模板（Prim+优先队列）

const int INF = 0xfffffff;
const int M = 1005;
Graph<M,M*M> g;
int Dis[M];
bool Vist[M];

struct Node{
Node(){}
Node(int Len, int Ind):len(Len),ind(Ind){}
int len,ind;
bool operator<(const Node& node) const{
return len > node.len;
}
};

int Prim(int s, int n)
{
fill(Dis,Dis+M,INF);
int result = 0;
priority_queue<Node> Q;
CLR(Vist,false);
Dis[s] = 0;
struct Node cur;
Q.push(Node(0,s));
while(!Q.empty())
{
cur = Q.top(); Q.pop();
if(cur.len != Dis[ cur.ind ]) continue;
Vist[ cur.ind ] = true;
result += cur.len;
for(int i = g.H[ cur.ind ]; i != -1; i = g.Next[i])
{
if(!Vist[ g.Num[i] ] && g.Len[i] < Dis[ g.Num[i] ])
{
Dis[ g.Num[i] ] = g.Len[i];
Q.push(Node(Dis[ g.Num[i] ],g.Num[i]));
}
}
}
return result;
}