Graphs10 min read

Depth-First Search (DFS)

Dive deep into a graph before backtracking. Useful for topological sorting and finding connected components.

Dive deep into a graph before backtracking. Useful for topological sorting and finding connected components.

This graphs guide explains the runtime and memory behavior behind depth-first search (dfs), including practical examples and Big O tradeoffs.

The full interactive lesson loads immediately after hydration so readers can explore formulas, code snippets, and visual complexity comparisons.

Try The Time Complexity Calculator

If you want to test similar code instantly, use the live time complexity calculator and compare the result with the explanation in this tutorial.

Open Time Calculator

Related Tutorials

Graphs

Dijkstra's Shortest Path

Find the shortest paths between nodes in a graph. Essential for routing, navigation, and network analysis.

Read Guide

Graphs

Breadth-First Search (BFS)

Explore a graph level by level. Perfect for finding the shortest path in unweighted graphs.

Read Guide