leetcode(复制无向图)

题目描述
Clone an undirected graph. Each node in the graph contains alabeland a list of itsneighbors.
OJ’s undirected graph serialization:
Nodes are labeled uniquely.
We use#as a separator for each node, and,as a separator for node label and each neighbor of the node.
As an example, consider the serialized graph{0,1,2#1,2#2,2}.
The graph has a total of three nodes, and therefore contains three parts as separated by#.

First node is labeled as0. Connect node0to both nodes1and2.
Second node is labeled as1. Connect node1to node2.
Third node is labeled as2. Connect node2to node2(itself), thus forming a self-cycle.

Visually, the graph looks like the following:

   1
  / \
 /   \
0 --- 2
     / \
     \_/

解题过程：分为深度优先(dfs)和广度优先(bfs)，linkedlist可以用作队列和栈两种形式，所以都是以它来实现。

广度优先遍历算法（bfs）用queue队列实现
import java.util.*;
public class Solution {
    public UndirectedGraphNode cloneGraph(UndirectedGraphNode node) {
        if(node == null)
              return null;
          HashMap<UndirectedGraphNode, UndirectedGraphNode> hm = new HashMap<UndirectedGraphNode, UndirectedGraphNode>();
          LinkedList<UndirectedGraphNode> queue = new LinkedList<UndirectedGraphNode>();
          UndirectedGraphNode head = new UndirectedGraphNode(node.label);
          hm.put(node, head);
          queue.add(node);

         while(!queue.isEmpty()){
             UndirectedGraphNode curnode = queue.poll();
             for(UndirectedGraphNode aneighbor: curnode.neighbors){//check each neighbor
                 if(!hm.containsKey(aneighbor)){//if not visited,then add to queue
                     queue.add(aneighbor);
                     UndirectedGraphNode newneighbor = new UndirectedGraphNode(aneighbor.label);
                     hm.put(aneighbor, newneighbor);
                 }

                 hm.get(curnode).neighbors.add(hm.get(aneighbor));
             }
         }

     return head;
}

}

深度优先遍历算法（dfs）用stack栈实现
public UndirectedGraphNode cloneGraph(UndirectedGraphNode node) {
         if(node == null)
             return null;

         HashMap<UndirectedGraphNode, UndirectedGraphNode> hm = new HashMap<UndirectedGraphNode, UndirectedGraphNode>();
         LinkedList<UndirectedGraphNode> stack = new LinkedList<UndirectedGraphNode>();
         UndirectedGraphNode head = new UndirectedGraphNode(node.label);
         hm.put(node, head);
         stack.push(node);

         while(!stack.isEmpty()){
             UndirectedGraphNode curnode = stack.pop();
             for(UndirectedGraphNode aneighbor: curnode.neighbors){//check each neighbor
                 if(!hm.containsKey(aneighbor)){//if not visited,then push to stack
                     stack.push(aneighbor);
                     UndirectedGraphNode newneighbor = new UndirectedGraphNode(aneighbor.label);
                     hm.put(aneighbor, newneighbor);
                 }                 
                 hm.get(curnode).neighbors.add(hm.get(aneighbor));
             }
         }
         return head;
     }