Changed the header a bit, added heap files for priority queue, and have implemented 99% of dijkstra's algorithm. Something is wrong though about array accesses.
Merge branch 'proctopj' of https://github.com/proctopj/08_Graph_Lab into proctopj
I fixed a tiny variable naming error. Now it works fine.
I believe I have completely fixed my modified Dijkstra's algorithm.
Made sure to explicitly call destructors.
Merge pull request #19 from proctopj/proctopj

Proctopj