LeetCode 133. Clone Graph

最新推荐文章于 2021-05-20 23:15:46 发布

qufayudao

最新推荐文章于 2021-05-20 23:15:46 发布

阅读量188

点赞数

分类专栏：算法题文章标签： c# leetCode bfs 算法图

本文链接：https://blog.csdn.net/qufayudao/article/details/79588569

版权

算法题专栏收录该内容

36 篇文章 0 订阅

订阅专栏

描述

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

思路
对图进行克隆，显然只需要一种遍历算法，作为图的遍历算法有广度优先搜索算法与深度优先搜索算法，这里采用深度优先遍历。采用深度遍历算法进行遍历，在遍历到该节点时，将该节点克隆，然后再将其邻节点也克隆，当遍历完时，这个图就算克隆完了。在这里，我认为最重要的就是判断该节点是否被访问过了，以前在使用c语言时，一般都是用矩阵存储该节点是否被访问过了，但是在c#里面，可以使用每个对象都具有的方法GetHashCode,这个方法返回表示该对象的唯一标识，当访问了一个节点时，将这个标识存放到有序集合中，key为该节点的hash，value为克隆的节点。这样即可用于判断该节点是否被访问过。
代码（c#）

public UndirectedGraphNode CloneGraph(UndirectedGraphNode node)
        {
            SortedList<int, UndirectedGraphNode> sortedList = new SortedList<int, UndirectedGraphNode>();
            return GraphBfs(node, sortedList);
        }
        public UndirectedGraphNode GraphBfs(UndirectedGraphNode node, SortedList<int, UndirectedGraphNode> sortedList)
        {
            if (node != null)
            {
                var key = node.GetHashCode();
                if (sortedList.ContainsKey(key))//该节点被访问过了
                {
                    return sortedList[key];//返回已经生成的节点，有时候即是自己
                }
                var element = new UndirectedGraphNode(node.label);//克隆一个节点
                sortedList.Add(key, element);//保存访问过的信息
                foreach (var item in node.neighbors)//克隆所有的子节点
                {
                    var c = GraphBfs(item, sortedList);
                    if (c != null)
                    {
                        element.neighbors.Add(c);
                    }
                }
                return element;
            }
            return null;
        }