<Li> A * search algorithm solves for single pair shortest path using heuristics to try to speed up the search . </Li> <Li> Floyd--Warshall algorithm solves all pairs shortest paths . </Li> <Li> Johnson's algorithm solves all pairs shortest paths, and may be faster than Floyd--Warshall on sparse graphs . </Li> <Li> Viterbi algorithm solves the shortest stochastic path problem with an additional probabilistic weight on each node . </Li>

The time complexity of the shortest path algorithm can be bounded by