A canonical problem in computer science is to find the shortest route to every point in a network. A new approach beats the classic algorithm taught in textbooks.

DIJKSTRA(G, s): for each vertex v in V: dist[v] ← ∞ prev[v] ← NIL dist[s] ← 0 Q ← V while Q ≠ ∅: u ← vertex in Q with min dist[u] remove u from Q for each neighbor v of u: if dist[u] + w(u,v) < dist[v ...

Researchers from EPFL, AMD, and the University of Novi Sad have uncovered a long-standing inefficiency in the algorithm that ...

Pull requests help you collaborate on code with other people. As pull requests are created, they’ll appear here in a searchable and filterable list. To get started, you should create a pull request.