[Leetcode] clone Graph

Clone an undirected graph. each node in the graph containsLabelAnd 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#.

1. First node is labeled0. Connect Node0To both nodes1And2.
2. Second node is labeled1. Connect Node1To Node2.
3. Third node is labeled2. Connect Node2To Node2(Itself), thus forming a self-cycle.

 

Visually, the graph looks like the following:

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


Solution:
http://blog.csdn.net/fightforyourdream/article/details/17497883

[Leetcode] clone Graph