Single source single target shortest paths

Input

1. A directed graph [math]\displaystyle{ G=(V,A) }[/math]
2. an arc weight [math]\displaystyle{ l(a) \in \mathbb{R} }[/math] for each arc [math]\displaystyle{ a \in A }[/math]
3. Two nodes [math]\displaystyle{ s,t \in V }[/math]

Output

The length of a shortest [math]\displaystyle{ (s,t) }[/math]-path in [math]\displaystyle{ G }[/math] subject to [math]\displaystyle{ l }[/math]

Objective

N/A

Complexity

Polynomial

Known algorithms

• The A* variant on Dijkstra.