A Fast Implementation of FR-Dijkstra


The shortest path problem is the problem of finding the shortest distance from a specified source node to all other nodes in the graph. The best known algorithm for arbitrary graphs with real-valued weights is known as Bellman-Ford, and runs in O(nm) time, where m and n are the number of vertices and nodes in the graph, respectively. For an arbitrary graph… (More)


3 Figures and Tables

Slides referencing similar topics