码迷,mamicode.com
首页 > 其他好文 > 详细

[Leetcode] Clone Graph

时间:2014-10-12 10:27:37      阅读:135      评论:0      收藏:0      [点我收藏+]

标签:des   style   blog   http   color   io   ar   for   strong   

Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors.


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 #.

  1. First node is labeled as 0. Connect node 0 to both nodes 1 and 2.
  2. Second node is labeled as 1. Connect node 1 to node 2.
  3. Third node is labeled as 2. Connect node 2 to node 2 (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

标签:des   style   blog   http   color   io   ar   for   strong   

原文地址:http://www.cnblogs.com/Phoebe815/p/4020105.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!