# Single source shortest paths

## Input

1. A directed graph $G=(V,A)$
2. an arc weight $l(a) \in \mathbb{R}$ for each arc $a \in A$
3. a root node $s \in V$

## Output

For each $v \in V$, a real value $\delta (v)$, the length of a shortest $(s,v)$-path in $G$ subject to $l$

N/A

Polynomial