Patterns

Fundamentals/Depth First Search on Graphs

← Prev Next →

Given an adjacency list and a start node, return all nodes in DFS visit order.

Compare with siblingPattern: Graph — BFS/DFS on Adjacency List →

Pattern siblings

find_related_products
graph_bfs
graph_bfs_vs_dfs
graph_dfscurrent
longest_cycle
open_the_lock
shortest_path_unweight
sliding_puzzle
word_ladder
clone_graphmedium

Check siblings above to see their reference solutions side by side.