Abstract
The shortest path problem on weighted directed graphs is one of the basicnetwork optimization problems. Its importance is mainly due to its applica-tions in various areas, such as communication and transportation. Here we areinterested in the single-source case. When the graph is not required to satisfyany particular restriction and negative weight edges can occur, the problemis solved by the Bellman-Ford-Moore algorithm [Bel58,For56 ,Moo59], whosecomplexity is O(|V||E|), with V and E denoting the sets of nodes and ofedges, respectively. A more efficient solution due to Dijkstra [Dij59] is avail-able when weights are restricted to non-negative values. Depending on theimplementation used for maintaining a service priority queue, Dijkstra’s algo-rithm has complexity O(|V|
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
