算法-graph

ordering := { }. Repeat until graph is empty: Find a vertex v with in-degree of 0 Delete v and its o

Quick-find Quick-union Weighted quick-union Rather than arbitrarily connecting the second tree to th