Hello,

The shortest path between two given nodes is found out by Dijkstra's Original Algorithm. Bellman Ford's algorithm is a single-source algorithm with shortest path.
Dijkstra's algorithm and Bellman Ford's algorithm both of them are knows as single-source shortest path algorithms.
Hope this information helped you.
Best of Luck!!