-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathCloneGraph.java
More file actions
58 lines (55 loc) · 2.01 KB
/
Copy pathCloneGraph.java
File metadata and controls
58 lines (55 loc) · 2.01 KB
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
import java.util.HashMap;
import java.util.LinkedList;
import java.util.Queue;
/**
* 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:
*
* <code>
* 1
* / \
* / \
* 0 --- 2
* / \
* \_/
* </code>
*
* @author JoshLuo
*
*/
public class CloneGraph {
public UndirectedGraphNode cloneGraph(UndirectedGraphNode node) {
if (node == null) {
return null;
}
HashMap<UndirectedGraphNode, UndirectedGraphNode> originalToClone = new HashMap<UndirectedGraphNode, UndirectedGraphNode>();
Queue<UndirectedGraphNode> queue = new LinkedList<UndirectedGraphNode>();
UndirectedGraphNode clonedHead = new UndirectedGraphNode(node.label);
queue.add(node);
originalToClone.put(node, clonedHead);
while (!queue.isEmpty()) {
UndirectedGraphNode curNode = queue.poll();
for (UndirectedGraphNode neighbor : curNode.neighbors) {
if (!originalToClone.containsKey(neighbor)) {
queue.add(neighbor);
UndirectedGraphNode clonedNeighbor = new UndirectedGraphNode(neighbor.label);
originalToClone.put(neighbor, clonedNeighbor);
}
originalToClone.get(curNode).neighbors.add(originalToClone.get(neighbor));
}
}
return clonedHead;
}
}