Questions 6-10 completed

Added Connection, Tour and SearchAlgorithm classes, making use of both
the Depth First and Dijikstra Algorithms to solve the Travelling
Salesman problem.

Assertions continue to prove code correctness.