Do two undirected graphs have the same number of connected components?
2つの無向グラフが同数の連結部分を持つか?