
This article includes a list of references, but its sources remain unclear because it has insufficient inline citations.
(June 2009) (Learn how and when to remove this template message) 
In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized.
The problem of finding the shortest path between two intersections on a road map (the graph's vertices correspond to intersections and the edges correspond to road segments, each weighted by the length of its road segment) may be modeled by a special case of the shortest path problem in graphs.
The shortest path problem can be defined for graphs whether undirected, directed, or mixed. It is defined here for undirected graphs; for directed graphs the definition of path requires that consecutive vertices be connected by an appropriate directed edge.
Two vertices are adjacent when they are both incident to a common edge. A path in an undirected graph is a sequence of vertices such that is adjacent to for . Such a path is called a path of length from to . (The are variables; their numbering here relates to their position in the sequence and needs not to relate to any canonical labeling of the vertices.)
Let be the edge incident to both and . Given a realvalued weight function , and an undirected (simple) graph , the shortest path from to is the path (where and ) that over all possible minimizes the sum When each edge in the graph has unit weight or , this is equivalent to finding the path with fewest edges.
The problem is also sometimes called the singlepair shortest path problem, to distinguish it from the following variations:
These generalizations have significantly more efficient algorithms than the simplistic approach of running a singlepair shortest path algorithm on all relevant pairs of vertices.
The most important algorithms for solving this problem are:
Additional algorithms and associated evaluations may be found in Cherkassky, Goldberg & Radzik (1996).
Weights  Time complexity  Author 

ℝ_{+}  O(V^{2})  Dijkstra 1959 
ℝ_{+}  O(E + V log V)  Fredman & Tarjan 1984 (Fibonacci heap) 
ℕ  O(E)  Thorup 1999 (requires constanttime multiplication). 
Algorithm  Time complexity  Author 

Breadthfirst search  O(E + V) 
An algorithm using topological sorting can solve the singlesource shortest path problem in linear time, Θ(E + V), in weighted DAGs.
The following table is taken from Schrijver (2004). A green background indicates an asymptotically best bound in the table.
Algorithm  Time complexity  Author 

O(V ^{2}EL)  Ford 1956  
Bellman–Ford algorithm  O(VE)  Bellman 1958, Moore 1959 
O(V ^{2} log V)  Dantzig 1960, Minty (cf. Pollack & Wiebenson 1960), Whiting & Hillier 1960  
Dijkstra's algorithm with list  O(V ^{2})  Leyzorek et al. 1957, Dijkstra 1959 
Dijkstra's algorithm with modified binary heap  O((E + V) log V)  
. . .  . . .  . . . 
Dijkstra's algorithm with Fibonacci heap  O(E + V log V)  Fredman & Tarjan 1984, Fredman & Tarjan 1987 
O(E log log L)  Johnson 1981, Karlsson & Poblete 1983  
Gabow's algorithm  O(E log_{E/V} L)  Gabow 1983, Gabow 1985 
O(E + V √log L)  Ahuja et al. 1990  
Thorup  O(E + V log log V)  Thorup 2004 
Algorithm  Time complexity  Author 

Bellman–Ford algorithm  O(VE)  Bellman 1958, Moore 1959 
The allpairs shortest path problem finds the shortest paths between every pair of vertices v, v' in the graph. The allpairs shortest paths problem for unweighted directed graphs was introduced by Shimbel (1953), who observed that it could be solved by a linear number of matrix multiplications that takes a total time of O(V^{4}).
Weights  Time complexity  Algorithm 

ℝ_{+}  O(V^{3})  Floyd–Warshall algorithm 
Seidel's algorithm (expected running time).  
ℕ  Williams 2014  
ℝ_{+}  O(EV log α(E,V))  Pettie & Ramachandran 2002 
ℕ  O(EV)  Thorup 1999 (requires constanttime multiplication). 
Weights  Time complexity  Algorithm 

ℝ (no negative cycles)  O(V^{3})  Floyd–Warshall algorithm 
ℕ  Williams 2014  
ℝ (no negative cycles)  O(EV + V^{2} log V)  Johnson–Dijkstra 
ℝ (no negative cycles)  O(EV + V^{2} log log V)  Pettie 2004 
ℕ  O(EV + V^{2} log log V)  Hagerup 2000 
Shortest path algorithms are applied to automatically find directions between physical locations, such as driving directions on web mapping websites like MapQuest or Google Maps. For this application fast specialized algorithms are available.^{[1]}
If one represents a nondeterministic abstract machine as a graph where vertices describe states and edges describe possible transitions, shortest path algorithms can be used to find an optimal sequence of choices to reach a certain goal state, or to establish lower bounds on the time needed to reach a given state. For example, if vertices represent the states of a puzzle like a Rubik's Cube and each directed edge corresponds to a single move or turn, shortest path algorithms can be used to find a solution that uses the minimum possible number of moves.
In a networking or telecommunications mindset, this shortest path problem is sometimes called the mindelay path problem and usually tied with a widest path problem. For example, the algorithm may seek the shortest (mindelay) widest path, or widest shortest (mindelay) path.
A more lighthearted application is the games of "six degrees of separation" that try to find the shortest path in graphs like movie stars appearing in the same film.
Other applications, often studied in operations research, include plant and facility layout, robotics, transportation, and VLSI design.^{[2]}
A road network can be considered as a graph with positive weights. The nodes represent road junctions and each edge of the graph is associated with a road segment between two junctions. The weight of an edge may correspond to the length of the associated road segment, the time needed to traverse the segment, or the cost of traversing the segment. Using directed edges it is also possible to model oneway streets. Such graphs are special in the sense that some edges are more important than others for long distance travel (e.g. highways). This property has been formalized using the notion of highway dimension.^{[3]} There are a great number of algorithms that exploit this property and are therefore able to compute the shortest path a lot quicker than would be possible on general graphs.
All of these algorithms work in two phases. In the first phase, the graph is preprocessed without knowing the source or target node. The second phase is the query phase. In this phase, source and target node are known.The idea is that the road network is static, so the preprocessing phase can be done once and used for a large number of queries on the same road network.
The algorithm with the fastest known query time is called hub labeling and is able to compute shortest path on the road networks of Europe or the USA in a fraction of a microsecond.^{[4]} Other techniques that have been used are:
For shortest path problems in computational geometry, see Euclidean shortest path.
The travelling salesman problem is the problem of finding the shortest path that goes through every vertex exactly once, and returns to the start. Unlike the shortest path problem, which can be solved in polynomial time in graphs without negative cycles, the travelling salesman problem is NPcomplete and, as such, is believed not to be efficiently solvable for large sets of data (see P = NP problem). The problem of finding the longest path in a graph is also NPcomplete.
The Canadian traveller problem and the stochastic shortest path problem are generalizations where either the graph isn't completely known to the mover, changes over time, or where actions (traversals) are probabilistic.
The shortest multiple disconnected path ^{[5]} is a representation of the primitive path network within the framework of Reptation theory.
The widest path problem seeks a path so that the minimum label of any edge is as large as possible.
This section does not cite any sources.
(December 2015) (Learn how and when to remove this template message) 
Sometimes, the edges in a graph have personalities: each edge has its own selfish interest. An example is a communication network, in which each edge is a computer that possibly belongs to a different person. Different computers have different transmission speeds, so every edge in the network has a numeric weight equal to the number of milliseconds it takes to transmit a message. Our goal is to send a message between two points in the network in the shortest time possible. If we know the transmissiontime of each computer (the weight of each edge), then we can use a standard shortestpaths algorithm. If we do not know the transmission times, then we have to ask each computer to tell us its transmissiontime. But, the computers may be selfish: a computer might tell us that its transmission time is very long, so that we will not bother it with our messages. A possible solution to this problem is to use a variant of the VCG mechanism, which gives the computers an incentive to reveal their true weights.
There is a natural linear programming formulation for the shortest path problem, given below. It is very simple compared to most other uses of linear programs in discrete optimization, however it illustrates connections to other concepts.
Given a directed graph (V, A) with source node s, target node t, and cost w_{ij} for each edge (i, j) in A, consider the program with variables x_{ij}
The intuition behind this is that is an indicator variable for whether edge (i, j) is part of the shortest path: 1 when it is, and 0 if it is not. We wish to select the set of edges with minimal weight, subject to the constraint that this set forms a path from s to t (represented by the equality constraint: for all vertices except s and t the number of incoming and outcoming edges that are part of the path must be the same (i.e., that it should be a path from s to t).
This LP has the special property that it is integral; more specifically, every basic optimal solution (when one exists) has all variables equal to 0 or 1, and the set of edges whose variables equal 1 form an st dipath. See Ahuja et al.^{[6]} for one proof, although the origin of this approach dates back to mid20th century.
The dual for this linear program is
and feasible duals correspond to the concept of a consistent heuristic for the A* algorithm for shortest paths. For any feasible dual y the reduced costs are nonnegative and A* essentially runs Dijkstra's algorithm on these reduced costs.
This section needs expansion. You can help by adding to it. (August 2014)

Many problems can be framed as a form of the shortest path for some suitably substituted notions of addition along a path and taking the minimum. The general approach to these is to consider the two operations to be those of a semiring. Semiring multiplication is done along the path, and the addition is between paths. This general framework is known as the algebraic path problem.^{[7]}^{[8]}^{[9]}
Most of the classic shortestpath algorithms (and new ones) can be formulated as solving linear systems over such algebraic structures.^{[10]}
More recently, an even more general framework for solving these (and much less obviously related problems) has been developed under the banner of valuation algebras.^{[11]}
In reallife situations, the transportation network is usually stochastic and timedependent. In fact, a traveler traversing a link daily may experiences different travel times on that link due not only to the fluctuations in travel demand (origindestination matrix) but also due to such incidents as work zones, bad weather conditions, accidents and vehicle breakdowns. As a result, a stochastic timedependent (STD) network is a more realistic representation of an actual road network compared with the deterministic one.^{[12]}^{[13]}
Despite considerable progress during the course of the past decade, it remains a controversial question how an optimal path should be defined and identified in stochastic road networks. In other words, there is no unique definition of an optimal path under uncertainty. One possible and common answer to this question is to find a path with the minimum expected travel time. The main advantage of using this approach is that efficient shortest path algorithms introduced for the deterministic networks can be readily employed to identify the path with the minimum expected travel time in a stochastic network. However, the resulting optimal path identified by this approach may not be reliable, because this approach fails to address travel time variability. To tackle this issue some researchers use distribution of travel time instead of expected value of it so they find the probability distribution of total traveling time using different optimization methods such as dynamic programming and Dijkstra's algorithm .^{[14]} These methods use stochastic optimization, specifically stochastic dynamic programming to find the shortest path in networks with probabilistic arc length.^{[15]} It should be noted that the concept of travel time reliability is used interchangeably with travel time variability in the transportation research literature, so that, in general, one can say that the higher the variability in travel time, the lower the reliability would be, and vice versa.
In order to account for travel time reliability more accurately, two common alternative definitions for an optimal path under uncertainty have been suggested. Some have introduced the concept of the most reliable path, aiming to maximize the probability of arriving on time or earlier than a given travel time budget. Others, alternatively, have put forward the concept of an αreliable path based on which they intended to minimize the travel time budget required to ensure a prespecified ontime arrival probability.