The classic breadth-first-search and depth-first-search algorithms, as applied to the London Tube map.
It turns out these aren't very good algorithms for route finding (especially depth first, that's really a disaster). So maybe we should add Dijkstra's algorithm at some stage.