Bellman-ford algorithm will find the shortest path to all of the vertices from the source node.
Dijkstra's shortest path algorithm finds the shortest path from the source node to the target node.