← Back to Issue

The Depth-First Search Pattern: Exploring Trees And Graphs

From Pointer · subscribed via aiste.ulozaite@gmail.com · original ↗ · unsubscribe

DFS is the pattern you reach for when you need to find a path, check if something is reachable, or explore all possible paths through a structure. It works on trees, graphs, and many problems that can be represented as graphs, even if they don’t look like one at first glance.

Couldn’t fetch the full article — read it on the original site ↗.