FilesExpand file tree

 master

/

CloneGraph.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

53 lines (46 loc) · 1.42 KB

 master

/

CloneGraph.java

Copy path

Top

File metadata and controls

• Code
• Blame

53 lines (46 loc) · 1.42 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

package leetcode;

import java.util.ArrayList;

import java.util.HashMap;

import java.util.LinkedList;

import java.util.List;

import java.util.Queue;

public class CloneGraph {

public static void main(String[] args) {

CloneGraph test = new CloneGraph();

UndirectedGraphNode g0= new UndirectedGraphNode(0);

UndirectedGraphNode g1= new UndirectedGraphNode(1);

UndirectedGraphNode g2= new UndirectedGraphNode(2);

g0.neighbors.add(g1);

g0.neighbors.add(g2);

g1.neighbors.add(g2);

g2.neighbors.add(g2);

UndirectedGraphNode clone = test.cloneGraph(g0);

}

public UndirectedGraphNode cloneGraph(UndirectedGraphNode node) {

if(node==null) return null;

HashMap<UndirectedGraphNode, UndirectedGraphNode> mapVisited = new HashMap<>();

Queue<UndirectedGraphNode> q= new LinkedList<>();

UndirectedGraphNode clone= new UndirectedGraphNode(node.label);

mapVisited.put(node,clone);

q.offer(node);

while(!q.isEmpty()){

UndirectedGraphNode x = q.poll();

for(UndirectedGraphNode nb : x.neighbors){

if(!mapVisited.containsKey(nb)){

mapVisited.put(nb, new UndirectedGraphNode(nb.label));

q.offer(nb);

}

mapVisited.get(x).neighbors.add(mapVisited.get(nb));

}

}

return clone;

}

}

class UndirectedGraphNode{

int label;

List<UndirectedGraphNode> neighbors;

UndirectedGraphNode(int x){

label= x;

neighbors = new ArrayList<UndirectedGraphNode>();

}

}