| Problem VariationsVariations of the Shortest Path ProblemSingle PairInput
				A directed weighted graph
				 and vertices   Output
				A shortest
				 -path and its weight. Single SourceInput
				A directed weighted graph
				 and vertex  . Output
				A shortest
				 -path
				 and its weight for all  . All PairsInput
				A directed weighted graph
				 . Output
				For every pair
				 of vertices  a shortest  -path and its weight. |