Shortest Path Faster Algorithm
Simpler than Dijkstra Algorithm and much faster for some cases
- Use a FIFO Queue.
- Enqueue if not exist
- For grid topology and sparse graph, much faster than Dijkstra Algorithm
SPFA
Creator
Creator
Seonglae ChoCreated
Created
2023 Nov 2 6:33Editor
Editor
Seonglae ChoEdited
Edited
2023 Nov 2 6:34Refs
Refs