# st-Shortest Path (Shortest Path (Directed Graphs))

Jump to navigation
Jump to search

## Description

Given a weighted digraph $G=(V,E)$, find the shortest path between two given vertices $s$ and $t$.

## Related Problems

Subproblem: Second Shortest Simple Path, 2-sensitive (7/5)-approximate st-shortest paths, 1-sensitive decremental st-shortest paths, 2-sensitive decremental st-shortest paths, Replacement Paths Problem

Related: General Weights, Nonnegative Weights, Nonnegative Integer Weights, 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.