new · 18 pairs atlas problems fields listen quant AI philosophy

algonow/algorithms/Bidirectional BFS

Bidirectional BFS

Pairings in the atlas

standalonestandardMeet-in-the-middle reach graphs-paths

Rivals: other methods for the same problems

Depth-first search
Iterative deepening DFS

Where it sits

graphs-paths · Graph Algorithms

Every entry is a real named method. Pairs that share a problem are rivals; that is the point. The live lessons ▸

Created by Eric Allione