About implementing shortest function:

READ Chapter 15 discussion about the algorithms!

Do shortest distances algorithm first
	Consider helper function for closest vertex
	Ignore paths for now

Then add way to track predecessors to algorithm
	Just need pred array, plus one line of code

Finally find paths using pred array data
	Fill the list back to front

By the way: See text's searches.h and .template