Software Engineer | Python, C, Data Structures, C++ | Artificial Intelligence | IoT & Cloud Enthusiast | Electronics and Communication Engineering Graduate | Open to Software Opportunities ...

Nodes 0, 1, and 2 form a cycle. If we remove 0 - 1, the graph remains connected. However, removing 1 - 3 disconnects nodes 3 and 4 from the rest of the graph.

# is united with its parent and the ancestor of the new set's root is set to the parent. # Queries are answered when both nodes in a pair have been visited.

void add(int x, int y) { // 注意，这里的编号从 0 开始 ver[tot] = y, ne[tot] = h[x], h[x] = tot++; ver[tot] = x, ne[tot] = h[y], h[y] = tot++; ...