通过BFS 和 DFS两种方法找无向图的连通分量

class Solution {
public:
    /**
     * @param nodes a array of Undirected graph node
     * @return a connected set of a Undirected graph
     */
    // BFS 
    vector<vector<int>> connectedSet1(vector<UndirectedGraphNode*>& nodes) {
        // Write your code here
        vector<vector<int>> result;
        unordered_map<UndirectedGraphNode *, bool> map;// if visited or not
        
        for(UndirectedGraphNode * node : nodes){
            if(map.find(node) != map.end()){
                continue;
            }
            
            queue<UndirectedGraphNode*> q;
            q.push(node);
            map[node] = true;
            
            vector<int> row;// 一个子图 或者说 一个group节点
            while(!q.empty()){
                UndirectedGraphNode * now = q.front();
                q.pop();
                row.push_back(now->label);
                
                for(int