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

Method dfs

133-clone-graph/clone-graph.py:18–28  ·  view source on GitHub ↗
(original)

Source from the content-addressed store, hash-verified

16 visited = {}
17
18 def dfs(original):
19 if original in visited:
20 return visited[original]
21
22 clone = Node(original.val)
23 visited[original] = clone
24
25 for neighbor in original.neighbors:
26 clone.neighbors.append(dfs(neighbor))
27
28 return clone
29
30 return dfs(node)

Callers

nothing calls this directly

Calls 2

NodeClass · 0.70
dfsFunction · 0.70

Tested by

no test coverage detected