Add a Dijsktra implementation to test against #35
Description
Add a simple Dijkstra implementation and a test case by setting a random node ID from the existing set as the Source and have it to return a shortest paths by both the BMSSP algorithm and an implementation of Dijskstra expecting both to be the same.
The BMSSP algorithm right now has an output list shortestPaths and with the initial run can only output an infinite distance to all except the source.