MCPcopy Create free account
hub / github.com/Hsinha11/Leetcode-solutions / dfs

Method dfs

133-clone-graph/clone-graph.java:30–41  ·  view source on GitHub ↗
(Node node, Map<Node, Node> visited)

Source from the content-addressed store, hash-verified

28 }
29
30 private Node dfs(Node node, Map<Node, Node> visited) {
31 if (visited.containsKey(node)) return visited.get(node);
32
33 Node clone = new Node(node.val);
34 visited.put(node, clone);
35
36 for (Node neighbor : node.neighbors) {
37 clone.neighbors.add(dfs(neighbor, visited));
38 }
39
40 return clone;
41 }
42}

Callers 1

cloneGraphMethod · 0.95

Calls 1

getMethod · 0.80

Tested by

no test coverage detected