Added initialisation code for the graph
Refined fields for GraphNode class. Better reflects how it is explained in Corman
Added tests for Graph class
Created StartNode class to deal with javas lack of a pair object.
Removed startNode. Realised that there was no need for a pair as the adjacency matrix represents the edges between nodes not the nodes themselves
Removed the value from the GraphNode object. No reason for it. Not used in any calculations.
Reworked to fit new abstraction
Renamed BFSearcher to BFS
Moved initialisation of the start node to the BFS search method. More inline with Corman algorithm
Improved graph tests
Tidied Graph data structure