Shortest Path Faster Algorithm: Finding shortest path from a node

graph-algorithm
shortest-path
shortest-path-faster-algorithm

(Team) #1

Reading time: 12 minutes | Coding time: 9 minutes

The Shortest Path Faster Algorithm (SPFA) is an improvement of the Bellman–Ford algorithm which computes single-source shortest paths in a weighted directed graph. The algorithm is believed to work well on random sparse graphs and is particularly suitable for graphs that contain negative-weight edges.


This is a companion discussion topic for the original entry at http://iq.opengenus.org/shortest-path-faster-algorithm/