General Weights (Shortest Path (Directed Graphs))

Description

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.

Related Problems

Subproblem: Nonnegative Weights

Related: Nonnegative Integer Weights, Second Shortest Simple Path, st-Shortest Path, 1-sensitive (3/2)-approximate ss-shortest paths, 2-sensitive (7/5)-approximate st-shortest paths, 1-sensitive decremental st-shortest paths, 2-sensitive decremental st-shortest paths, Replacement Paths Problem

Parameters

V: number of vertices

E: number of edges

L: maximum absolute value of edge cost

Table of Algorithms

Currently no algorithms in our database for the given problem.