Commit 48d4b59

authored

refactor: update undirected_path_v2.py

1 parent 5a361ef commit 48d4b59Copy full SHA for 48d4b59

File tree

-7

lines changed

-7

lines changed

Lines changed: 1 addition & 7 deletions

Original file line number	Diff line number	Diff line change
`@@ -91,13 +91,7 @@ def has_path(graph: dict[int, list[int]], src: int, dst: int, visited: set[int])`
`91`	`91`
`92`	`92`	`return False # If no path is found from any neighbor, return False`
`93`	`93`
`94`		`-`
`95`		`-# Docstring Section`
`96`		`-`
`97`	`94`	`# Time Complexity: O(E)`
`98`	`95`	`# The time complexity of this algorithm is O(E), where E is the number of edges in the graph.`
`99`	`96`
`100`		`-Space: O(e)`
`101`		`-`
`102`		`-"""`
`103`		`-`
	`97`	`+# Space: O(e)`

Comments

(0)