Essential things to remember from today's class (class 5, 6th September)

How to create an in-memory graph from an external (disc file) representation.

How to find the shortest path recursively through the use of vectors and
   an accumulated distance travelled so far.

For graphs where all links/connections are the same cost/length,
   how to use an ordinary queue for an efficient shortest path algorithm.