Problem Variations
Variations of the Shortest Path Problem
Single Pair
Input
A directed weighted graph
and vertices
Output
A shortest
-path and its weight.
Single Source
Input
A directed weighted graph
and vertex
.
Output
A shortest
-path
and its weight for all
.
All Pairs
Input
A directed weighted graph
.
Output
For every pair
of vertices
a shortest
-path and its weight.
|