MCPcopy Create free account
hub / github.com/neetcode-gh/leetcode / dfs

Method dfs

python/0133-clone-graph.py:5–13  ·  view source on GitHub ↗
(node)

Source from the content-addressed store, hash-verified

3 oldToNew = {}
4
5 def dfs(node):
6 if node in oldToNew:
7 return oldToNew[node]
8
9 copy = Node(node.val)
10 oldToNew[node] = copy
11 for nei in node.neighbors:
12 copy.neighbors.append(dfs(nei))
13 return copy
14
15 return dfs(node) if node else None

Callers

nothing calls this directly

Calls 2

NodeClass · 0.70
dfsFunction · 0.50

Tested by

no test coverage detected