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. However, the worst-case complexity of SPFA is the same as that of Bellman–Ford, so for graphs with nonnegative edge weights Dijkstra's algorithm is preferred. The SPFA algorithm was first published by Edward F. Moore in 1959, as a generalization of breadth first search; SPFA is Moore's “Algorithm D.” The name, “Shortest Path Faster Algorithm (SPFA),” was given by FanDing Duan, a Chinese researcher who rediscovered the algorithm in 1994.
referenceFull Form | Category |
---|---|
Steel Plate Fabricators Association | Business |
Syndicat des Producteurs de Films d'Animation (French film producers association) | Community |
Single Parent Family Association Inc. (Baulkham Hills, New South Wales, Australia) | Community |
Shortest Path Faster Algorithm | General |
Spray Polyurethane Foam Alliance (trade organization) | Governmental |
Single Point Failure Analysis | Governmental |
Seamen's Provident Fund Act | Governmental |
Solidarite Protestante France-Armenie (French: Protestant Solidarity France-Armenia) | International |
Fausa, Peru | Regional |
Ever curious about what that abbreviation stands for? fullforms has got them all listed out for you to explore. Simply,Choose a subject/topic and get started on a self-paced learning journey in a world of fullforms.
Allow To Receive Free Coins Credit 🪙