{"id":"maps-dual-mode-astar-dijkstra","text":"`_find_path` implements both A* and Dijkstra via a single code path; setting `algorithm != \"astar\"` zeroes the heuristic, collapsing A* to Dijkstra.","truth_value":"IN","source":"entries/2026/06/05/google-maps-map_routing.md","source_url":"","source_hash":"","justifications":[],"dependents":["multiple-algorithms-behind-unified-interface"],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"maps-dual-mode-astar-dijkstra","truth_value":"IN","reason":"premise"}]}}