Graph traversal and uninformed search

3 methods in the atlas attack this one problem. They are rivals: each wins something the others do not.

Phrasings that mean this problem

Graph exploration backboneMemory-lean complete searchMeet-in-the-middle reach

graphs-paths

Depth-first searchstandalonecanongraphs-paths
Iterative deepening DFSstandalonestandardgraphs-paths
Bidirectional BFSstandalonestandardgraphs-paths