Kruskal算法-最小生成树

template <class Type>
class EdgeNode{
    friend ostream& operator<<(ostream&,EdgeNode<Type>);
    friend bool Kruskal(int,int,EdgeNode<Type> *,EdgeNode<Type> *);
    friend void main(void);
    public:
        operator Type() const{return weight;}
    private:
        Type weight;
        int u,v;
};
template <class Type>
bool Kruskal(int n,int e,EdgeNode<Type> E[],EdgeNode <Type> t[])
{
    MinHeap<EdgeNode<Type>> H(1);
    H.Initialize(E,e,e);
    UnionFind U(n);
    int k = 0;
    while(e && k<n-1)
    {
        EdgeNode<int> x;
        H.DeleteMin(x);
        e--;
        int a = U.Find(x.u);
        int b = U.Find(x.v);
        if(a != b)
        {
            t[k++] = x;
            U.Union(a,b);
        }
    }
    H.Deactivate();
    return (k == n-1);
}