Graph DFS

Recursive depth-first search.

graph DFS recursion

Implement `dfs(graph: dict[int, list[int]], start: int) -> list[int]`.

Return nodes in DFS order (use a visited set to avoid cycles).

Constraints

0 ≤ nodes ≤ 1000. Graph is adjacency list (dict).

Example

>>> dfs({1:[2,3],2:[4],3:[],4:[]}, 1)
[1, 2, 4, 3]

28 points ~25 min

Recent Submissions

No submissions yet — hit Run Tests to try!

Hints

visited set + recursive helper appending to result list.

Test Results

Press Ctrl+Enter or click Run Tests to execute your code.