dijkstra algorithim

This is a python implementation of Dijkstra: To be noted that due to the lack of a method in heapq to update priority in python's heapq I opted for a non-optimal O(N) remove and readd nodes in the heap. This returns a hash with all the distances and their respective paths