-
Notifications
You must be signed in to change notification settings - Fork 1
/
clone-graph.js
86 lines (81 loc) · 2.01 KB
/
clone-graph.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
/**
* Source: https://leetcode.com/problems/clone-graph/
* Tags: [Depth-first Search,Breadth-first Search,Graph]
* Level: Medium
* Title: Clone Graph
* Auther: @imcoddy
* Content: 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:
*
* 1
* / \
* / \
* 0 --- 2
* / \
* \_/
*/
/**
* Definition for undirected graph.
* function UndirectedGraphNode(label) {
* this.label = label;
* this.neighbors = []; // Array of UndirectedGraphNode
* }
*/
/**
* @param {UndirectedGraphNode} graph
* @return {UndirectedGraphNode}
*/
/**
* Memo: Clone the graph recursively using DFS.
* Complex: O(n)
* Runtime: 264ms
* Tests: 12 test cases passed
* Rank: A
* Updated: 2015-06-04
*/
var cloneGraph = function(graph) {
var cloned = {};
function clone(node) {
if (!node) return null;
if (cloned[node.label]) return cloned[node.label];
var cloneNode = new UndirectedGraphNode(node.label);
cloned[node.label] = cloneNode;
for (var i = 0; i < node.neighbors.length; i++) {
cloneNode.neighbors.push(clone(node.neighbors[i]));
}
return cloneNode;
}
return clone(graph);
};
function UndirectedGraphNode(label) {
this.label = label;
this.neighbors = []; // Array of UndirectedGraphNode
}