LeetCode 133. Clone Graph

最新推荐文章于 2021-12-18 21:11:27 发布

ActiveCoder

最新推荐文章于 2021-12-18 21:11:27 发布

阅读量333

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 题解 Multiple Passes

本文链接：https://blog.youkuaiyun.com/github_34333284/article/details/51319556

LeetCode 题解同时被 2 个专栏收录

288 篇文章

订阅专栏

Multiple Passes

85 篇文章

订阅专栏

本文介绍了一种无向图的克隆算法，通过BFS和DFS两种方式实现节点及其邻居的复制。解决了图复制中节点唯一性和邻居关系保持的问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Clone an undirected graph. Each node in the graph contains a label and 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 as 0. Connect node0 to both nodes 1 and2.
Second node is labeled as 1. Connect node1 to node 2.
Third node is labeled as 2. Connect node2 to node 2 (itself), thus forming a self-cycle.

Visually, the graph looks like the following:

When comes to graph, usually comes with a mess. Actually graph is not that complicated.

This problem is a good one to dissolve the fear.

    // this is to use BFS.
    UndirectedGraphNode *cloneGraph(UndirectedGraphNode *node) {
        if(!node) return NULL;
        unordered_map<UndirectedGraphNode*, UndirectedGraphNode*> hashMap;
        hashMap.insert({node, new UndirectedGraphNode(node->label)});
        queue<UndirectedGraphNode*> nodes;
        nodes.push(node);
        while(!nodes.empty()) {
            auto v = nodes.front();
            nodes.pop();
            for(UndirectedGraphNode* e : v->neighbors) {
                if(hashMap.find(e) == hashMap.end()) {
                    hashMap.insert({e,  new UndirectedGraphNode(e->label)});
                    nodes.push(e);
                }
                (hashMap[v]->neighbors).push_back(hashMap[e]);
            }
        }
        return hashMap[node];
    }

It can also be done using dfs.

void dfs(unordered_map<UndirectedGraphNode*, UndirectedGraphNode*> hashMap, UndirectedGraphNode* node) {
  if(!node) return;
  for(auto e : node->neighbors) {
    if(hashMap.find(e) == hashMap.end()) {
      hashMap[e] = new UndirectedGraphNode(e->val);
      dfs(hashMap, e);
    }
    hashMap[e]->neighbors.push_back(hashMap[e]);
  }
}

UndirectedGraphNode* cloneGraph(UndirectedGraphNode* node) {
  if(!root) return NULL;
  unordered_map<UndirectedGraphNode*, UndirectedGraphNode*> hashMap;
  UndirectedGraphNod* head = new UndirectedGraphNode(node->val);
  hashMap.insert({node, head});
  dfs(hashMap, node);
  return head;
}