Just implemented A* and Dijkstra to get into pathfinding with graphs. Really hyped about this! TIL that Dijkstra is perfect to find the quickest subway route in my city 😏

Maps.google.com is probably much, much faster then anything anyone could make

@D--M Indeed! Although Dijkstra would be the most efficient algorithm possible for them (from what I head), it still takes way too long with this graph size. They use a solution where the paths are essentially precompiled so they basically just have to look them up when needed.