Shortest path problem

From Free net encyclopedia

In graph theory, the single-source shortest path problem is the problem of finding a path between two vertices such that the sum of the weights of its constituent edges is minimized. More formally, given a weighted graph (that is, a set V of vertices, a set E of edges, and a real-valued weight function f : E → R), and given further one element n of N, find a path P from n to each n' of N so that

is minimal among all paths connecting n to n' . The all-pairs shortest path problem is a similar problem, in which we have to find such paths for every two vertices n to n' .

A solution to the shortest path problem is sometimes called a pathing algorithm. The most important algorithms for solving this problem are:

Dijkstra's algorithm — solves single source problem if all edge weights are greater than or equal to zero. Without worsening the run time, this algorithm can in fact compute the shortest paths from a given start point s to all other nodes.
Bellman-Ford algorithm — solves single source problem if edge weights may be negative.
A* algorithm (or A* pathing algorithm) — a heuristic for single source shortest paths.
Floyd-Warshall algorithm — solves all pairs shortest paths.
Johnson's algorithm — solves all pairs shortest paths, may be faster than Floyd-Warshall on sparse graphs.
Perturbation theory; finds (at worst) the locally shortest path

A related problem is the traveling salesman problem, which is the problem of finding the shortest path that goes through every node exactly once, and returns to the start. That problem is NP-Complete, so an efficient solution is not likely to exist.

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. e.g.: Shortest (min-delay) widest path or Widest shortest (min-delay) path.

A good site in spanish: http://optimos2.diinf.usach.cl/swc (has references in english)

[edit]