Dijkstra’s algorithm doesn’t just tell you the fastest route to one destination. Instead, it gives you an ordered list of travel times from your current location to every other point that you might want to visit — a solution to what researchers call the single-source shortest-paths problem. https://quantamagazine.org/computer-scientists-establish-the-best-way-to-traverse-a-graph-20241025/ | Quanta Magazine