题目：找出无向图汇总的相连要素



找出无向图汇总的相连要素  查看运行结果   



18% 
通过

请找出无向图中相连要素的个数。

图中的每个节点包含其邻居的 1 个标签和 1 个列表。（一个无向图的相连节点（或节点）是一个子图，其中任意两个顶点通过路径相连，且不与超级图中的其它顶点相连。）

您在真实的面试中是否遇到过这个题？ 

Yes





样例 

给定图:
A------B  C
\     |  | 
  \    |  |
   \   |  |
    \  |  |
      D   E


返回 {A,B,D}, {C,E}。其中有 2 个相连的元素，即{A,B,D}, {C,E}
标签 Expand    

/**
* Definition for Undirected graph.
* class UndirectedGraphNode {
*     int label;
*     ArrayList<UndirectedGraphNode> neighbors;
*     UndirectedGraphNode(int x) { label = x; neighbors = new ArrayList<UndirectedGraphNode>(); }
* };
*/
public class Solution {
    /**
     * @param nodes a array of Undirected graph node
     * @return a connected set of a Undirected graph
     */
    public List<List<Integer>> connectedSet(ArrayList<UndirectedGraphNode> nodes) {
        // Write your code here
     List<List<Integer>> resList = new ArrayList<List<Integer>>();
          Queue<UndirectedGraphNode> quene = new LinkedList<UndirectedGraphNode>();
          List<UndirectedGraphNode> visited = new ArrayList<>();
          for (UndirectedGraphNode node : nodes) {
               if (!visited.contains(node)) {
                    List<Integer> path = new ArrayList<Integer>();
                    path.clear();
                    visited.add(node);
                    for (quene.offer(node); !quene.isEmpty(); quene.poll()) {
                         UndirectedGraphNode tmpnode = quene.peek();
                         path.add(tmpnode.label);
                         for (UndirectedGraphNode nn : tmpnode.neighbors) {
                              if (!visited.contains(nn)) {
                                   visited.add(nn);
                                   quene.offer(nn);
                              }
                         }
                    }
                    Collections.sort(path);
                    resList.add(path);

               }

          }
          return resList;
                
    }
}