Single source single target shortest paths

From Algowiki
Revision as of 10:39, 20 October 2014 by JanR (talk | contribs) (Created page with " == Input == # A directed graph <math>G=(V,A)</math> # an arc weight <math> l(a) \in \mathbb{R}</math> for each arc <math>a \in A</math> # Two nodes <math> s,t \in V </math>...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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

Known variants