Dijkstra’s algorithm doesn’t just tell you the fastest route to one destination.
Quanta Magazine
Visit on X@QuantaMagazine369K followers
275,092 views
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.
Comments
Comments from the original post on X (Twitter)
No comments yet

