Shortest path problem

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 ${\displaystyle P=(v_{1},v_{2},\ldots ,v_{n})\in V\times V\times \cdots \times V}$ such that ${\displaystyle v_{i}}$ is adjacent to ${\displaystyle v_{i+1}}$ for ${\displaystyle 1\leq i<n}$. Such a path ${\displaystyle P}$ is called a path of length ${\displaystyle n-1}$ from ${\displaystyle v_{1}}$ to ${\displaystyle v_{n}}$. (The ${\displaystyle v_{i}}$ 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 ${\displaystyle e_{i,j}}$ be the edge incident to both ${\displaystyle v_{i}}$ and ${\displaystyle v_{j}}$. Given a real-valued weight function ${\displaystyle f:E\rightarrow \mathbb {R} }$, and an undirected (simple) graph ${\displaystyle G}$, the shortest path from ${\displaystyle v}$ to ${\displaystyle v'}$ is the path ${\displaystyle P=(v_{1},v_{2},\ldots ,v_{n})}$ (where ${\displaystyle v_{1}=v}$ and ${\displaystyle v_{n}=v'}$) that over all possible ${\displaystyle n}$ minimizes the sum ${\displaystyle \sum _{i=1}^{n-1}f(e_{i,i+1}).}$ When each edge in the graph has unit weight or ${\displaystyle f:E\rightarrow \{1\}}$, this is equivalent to finding the path with fewest edges.

The problem is also sometimes called the single-pair shortest path problem, to distinguish it from the following variations:

• The single-source shortest path problem, in which we have to find shortest paths from a source vertex v to all other vertices in the graph.
• The single-destination shortest path problem, in which we have to find shortest paths from all vertices in the directed graph to a single destination vertex v. This can be reduced to the single-source shortest path problem by reversing the arcs in the directed graph.
• The all-pairs shortest path problem, in which we have to find shortest paths between every pair of vertices v, v' in the graph.

These generalizations have significantly more efficient algorithms than the simplistic approach of running a single-pair shortest path algorithm on all relevant pairs of vertices.

The most important algorithms for solving this problem are:

• Dijkstra's algorithm solves the single-source shortest path problem with non-negative edge weight.
• Bellman–Ford algorithm solves the single-source problem if edge weights may be negative.
• A* search algorithm solves for single-pair shortest path using heuristics to try to speed up the search.
• Floyd–Warshall algorithm solves all pairs shortest paths.
• Johnson's algorithm solves all pairs shortest paths, and may be faster than Floyd–Warshall on sparse graphs.
• Viterbi algorithm solves the shortest stochastic path problem with an additional probabilistic weight on each node.

Additional algorithms and associated evaluations may be found in Cherkassky, Goldberg & Radzik (1996).

The all-pairs shortest path problem finds the shortest paths between every pair of vertices v, v' in the graph. The all-pairs 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⁴).

Undirected graph

Weights	Time complexity	Algorithm
ℝ+	O(V3)	Floyd–Warshall algorithm
${\displaystyle \{1,\infty \}}$	${\displaystyle O(V^{\omega }\log V)}$	Seidel's algorithm (expected running time)
ℕ	${\displaystyle O(V^{3}/2^{\Omega (\log n)^{1/2}})}$	Williams 2014
ℝ+	O(EV log α(E,V))	Pettie & Ramachandran 2002
ℕ	O(EV)	Thorup 1999 applied to every vertex (requires constant-time multiplication).

Directed graph

Weights	Time complexity	Algorithm
ℝ (no negative cycles)	O(V3)	Floyd–Warshall algorithm
ℕ	${\displaystyle O(V^{3}/2^{\Omega (\log n)^{1/2}})}$	Williams 2014
ℝ (no negative cycles)	O(EV + V2 log V)	Johnson–Dijkstra
ℝ (no negative cycles)	O(EV + V2 log log V)	Pettie 2004
ℕ	O(EV + V2 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.[3]

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 min-delay path problem and usually tied with a widest path problem. For example, the algorithm may seek the shortest (min-delay) widest path, or widest shortest (min-delay) 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.[4]

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 NP-complete 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 NP-complete.

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 [7] 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.

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

minimize ${\displaystyle \sum _{ij\in A}w_{ij}x_{ij}}$ subject to ${\displaystyle x\geq 0}$ and for all i, ${\displaystyle \sum _{j}x_{ij}-\sum _{j}x_{ji}={\begin{cases}1,&{\text{if }}i=s;\\-1,&{\text{if }}i=t;\\0,&{\text{ otherwise.}}\end{cases}}}$

The intuition behind this is that ${\displaystyle x_{ij}}$ 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 s-t dipath. See Ahuja et al.[8] for one proof, although the origin of this approach dates back to mid-20th century.

The dual for this linear program is

maximize y_t − y_s subject to for all ij, y_j − y_i ≤ w_ij

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 ${\displaystyle w'_{ij}=w_{ij}-y_{j}+y_{i}}$ are nonnegative and A* essentially runs Dijkstra's algorithm on these reduced costs.

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.[9][10][11]

Most of the classic shortest-path algorithms (and new ones) can be formulated as solving linear systems over such algebraic structures.[12]

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.[13]

In real-life situations, the transportation network is usually stochastic and time-dependent. 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 (origin-destination matrix) but also due to such incidents as work zones, bad weather conditions, accidents and vehicle breakdowns. As a result, a stochastic time-dependent (STD) network is a more realistic representation of an actual road network compared with the deterministic one.[14][15]

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 travelling time using different optimization methods such as dynamic programming and Dijkstra's algorithm .[16] These methods use stochastic optimization, specifically stochastic dynamic programming to find the shortest path in networks with probabilistic arc length.[17] 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 pre-specified on-time arrival probability.

• Bidirectional search, an algorithm that finds the shortest path between two vertices on a directed graph
• Euclidean shortest path
• Flow network
• K shortest path routing
• Min-plus matrix multiplication
• Pathfinding
• Shortest Path Bridging
• Shortest path tree

• Frigioni, D.; Marchetti-Spaccamela, A.; Nanni, U. (1998). "Fully dynamic output bounded single source shortest path problem". Proc. 7th Annu. ACM-SIAM Symp. Discrete Algorithms. Atlanta, GA. pp. 212–221. CiteSeerX 10.1.1.32.9856.
• Dreyfus, S. E. (October 1967). An Appraisal of Some Shortest Path Algorithms (PDF) (Report). Project Rand. United States Air Force. RM-5433-PR. DTIC AD-661265.