* stubs for shortest path algorithms

* implemented leftist heap for use as priority queue
* findMin no longer should return an option
* made the heap use lazy deletion scheme
* edited some comments
* first draft of Dijkstra's shortest path algorithm
* fixed Heap.isEmpty implementation