searching for shortest path in a graph
v1.0 Code runs through all paths basically at the same time so not all paths need to be searched. v2.0 Code is cleaned up into a class. Some external varibales can be put into the class. Used maps to improve effeciency.