参考链接
http://blog.csdn.net/doc_sgl/article/details/12995765
http://blog.csdn.net/sunbaigui/article/details/16843647 简化版广度优先遍历
http://www.2cto.com/kf/201311/260615.html 深度优先遍历
题目描述
Clone Graph
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 #
.
- First node is labeled as
0
. Connect node0
to both nodes1
and2
. - Second node is labeled as
1
. Connect node1
to node2
. - Third node is labeled as
2
. Connect node2
to node2
(itself), thus forming a self-cycle.
Visually, the graph looks like the following:
1 / \ / \ 0 --- 2 / \ \_/
题目分析
关键点,一个原图到克隆图的map
总结
代码示例
/**
* Definition for undirected graph.
* struct UndirectedGraphNode {
* int label;
* vector<UndirectedGraphNode *> neighbors;
* UndirectedGraphNode(int x) : label(x) {};
* };
*/
class Solution {
public:
UndirectedGraphNode *cloneGraph(UndirectedGraphNode *node) {
// Note: The Solution object is instantiated only once and is reused by each test case.
if(node == NULL) return NULL;
map<UndirectedGraphNode *, UndirectedGraphNode *> hasCopied;
queue<UndirectedGraphNode *> uncompleteCopied;
hasCopied[node] = new UndirectedGraphNode(node->label);
//hasCopied[NULL] = NULL;
uncompleteCopied.push(node);
while(!uncompleteCopied.empty())
{
UndirectedGraphNode* pCurNode = uncompleteCopied.front();
uncompleteCopied.pop();
for(int i = 0; i < pCurNode->neighbors.size(); ++i)
{
UndirectedGraphNode* pNeighborNode = pCurNode->neighbors[i];
if(hasCopied.find(pNeighborNode) != hasCopied.end())
hasCopied[pCurNode]->neighbors.push_back(hasCopied[pNeighborNode]);
else
{
hasCopied[pNeighborNode] = new UndirectedGraphNode(pNeighborNode->label);
hasCopied[pCurNode]->neighbors.push_back(hasCopied[pNeighborNode]);
uncompleteCopied.push(pNeighborNode);
}
}
}
return hasCopied[node];
}
};
/**
* Definition for undirected graph.
* struct UndirectedGraphNode {
* int label;
* vector<UndirectedGraphNode *> neighbors;
* UndirectedGraphNode(int x) : label(x) {};
* };
*/
class Solution {
public:
UndirectedGraphNode *cloneGraph(UndirectedGraphNode *node) {
// Note: The Solution object is instantiated only once and is reused by each test case.
if(node == NULL) return NULL;
map<UndirectedGraphNode *, UndirectedGraphNode *> hasCopied;
queue<UndirectedGraphNode *> uncompleteCopied;
hasCopied[node] = new UndirectedGraphNode(node->label);
//hasCopied[NULL] = NULL;
uncompleteCopied.push(node);
while(!uncompleteCopied.empty())
{
UndirectedGraphNode* pCurNode = uncompleteCopied.front();
uncompleteCopied.pop();
for(int i = 0; i < pCurNode->neighbors.size(); ++i)
{
UndirectedGraphNode* pNeighborNode = pCurNode->neighbors[i];
if(hasCopied.find(pNeighborNode) != hasCopied.end())
hasCopied[pCurNode]->neighbors.push_back(hasCopied[pNeighborNode]);
else
{
hasCopied[pNeighborNode] = new UndirectedGraphNode(pNeighborNode->label);
hasCopied[pCurNode]->neighbors.push_back(hasCopied[pNeighborNode]);
uncompleteCopied.push(pNeighborNode);
}
}
}
return hasCopied[node];
}
};
推荐学习C++的资料
C++标准函数库
在线C++API查询
map使用方法
queue使用方法
vector使用方法