General Weights

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. Here, the weights can be any real number.

Parameters

$V$ : number of vertices
$E$ : number of edges
$L$ : maximum absolute value of edge cost

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Displaying 2 of 2 algorithms

				See more
Bellman–Ford algorithm (Shimbel 1955; Bellman 1958; Moore 1959)	1959	$O(VE)$	$O(V)$
Bellman–Ford algorithm (Ford 1956)	1956	$O(V^2 EL)$	$O(E)$

Reductions Table

Insuffient Data to display table

Other relevant algorithms