public KruskalMST(IEdgeWeightGraph G)
{
mst = new Chapter1.Queue <IEdge>();
MinPQ <IEdge> pq = new MinPQ <IEdge>();
foreach (var e in G.Edges())
{
pq.Insert(e);
}
UF uf = new UF(G.V);
while (!pq.IsEmpty && mst.Size < G.V - 1)
{
IEdge e = pq.Delete(); //找到权重最小的边
int v = e.Either, w = e.Other(v);
if (uf.Connected(v, w)) //忽略失效的边
{
continue;
}
uf.Union(v, w);
mst.Enqueue(e);
}
}
