bellmarn ford adding and S node to graph
Adding exercise test cases
First dijistra implementation, re-building heap everytime, could be better
testcase passes
 same results than jhonson's algoritm on page 703 of book
Adding test cases for Dijistra & Jhonson's