演算法›Ch4 圖論演算法
第 65 題/共 111 題
◀ AL 65/111
65. Disjoint Set、Union-Find
#AL-04-065易Disjoint SetUnion-Find
  1. Consider the following sequence of operations for disjoint sets (there is no set initially): Make-Set('a'), Make-Set('b'), Make-Set('c'), Union('b','c'), Make-Set('d'), Make-Set('e'), Make-Set('f'), Union('e','f'), Union('a','b'), Union('a','f')

Which of the following statement(s) is(are) true after this sequence of operations?

📄 交大110
跳轉到第題
▤完整推導請見《WH 資工筆記 · 演算法》Ch4 圖論演算法
本章題號 · 61–80 / 111