Route Planning with ArcadeDB: Dijkstra vs A* vs Contraction Hierarchies
Summary
Route Planning with ArcadeDB explains how exact shortest-path queries can be computed inside a graph database using Dijkstra, A*, and Customizable Contraction Hierarchies (CCH). The article compares performance on Florida’s road network (1.07 million junctions, 2.7 million road segments) and demonstrates live-traffic updates, multi-cost views, and how to run a local demo, emphasizing that CCH provides microsecond queries and is built into the database with an Apache 2.0 license.