- Article
On the Energy Behaviors of the Bellman–Ford and Dijkstra Algorithms: A Detailed Empirical Study
- Othman Alamoudi and
- Muhammad Al-Hashimi
The Single-Source Shortest Paths (SSSP) graph problem is a fundamental computation. This study attempted to characterize concretely the energy behaviors of the two primary methods to solve it, the Bellman–Ford and Dijkstra algorithms. The very...

