The Polymathic Engineer

The Polymathic Engineer

Fundamental Graph Algorithms - Part II: DFS

Depth First Search and its applications on undirected graphs: finding cycles and articulation vertices.

Franco Fernando's avatar
Franco Fernando
Dec 06, 2025
∙ Paid

Hi Friends,

Welcome to the 151st issue of the Polymathic Engineer.

This week, we’ll continue our discussion about fundamental graph algorithms. While we discussed Breadth-first search in the last issue, this article covers DFS. Depth-first search takes a different approach to graph traversal.

Instead of looking at neighbors level by level like BFS, DFS go…

This post is for paid subscribers

Already a paid subscriber? Sign in
© 2026 Franco Fernando · Privacy ∙ Terms ∙ Collection notice
Start your SubstackGet the app
Substack is the home for writing, podcasting, and media founders.