Extract Dijkstra algorithm parts to make them reusable.
Add Bellman-Ford algorithm implementation.
Merge pull request #7 from KL-7/bellman-ford

Bellman-Ford shortest paths algorithm