原书出处
Introduction to Algorithms, Fourth Edition
19 第19章 不相交集合的数据结构
seudocode, we denote the set of vertices of a graph G by G.V and the set of edges by G.E.
The procedure CONNECTED-COMPONENTS initially places each vertex v in its own set. Then, for each edge (u, v), it unites the sets containing u and v.
By Exercise 19.1-2, after all the edges are processed, two vertices belong to the same co
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter019.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea