Every map app is a wrapper around a shortest-path problem on a weighted graph. The clever bit in modern routers is preprocessing — contraction hierarchies, transit-node routing — but the core is still straight graph-theory.
Every map app is a wrapper around a shortest-path problem on a weighted graph. The clever bit in modern routers is preprocessing — contraction hierarchies, transit-node routing — but the core is still straight graph-theory.