private DijkstraAlgorithm getPathFinder() {
		List<Vertex> vertices = new ArrayList<Vertex>();
		List<Edge> edges = new ArrayList<Edge>();
		
		this.vertexArray = new Vertex[16];
		
		for(Entry<Byte,TreeSet<Byte>> neighbour : networkTreeMap.entrySet()) {
			String id = neighbour.getKey().toString();
			Vertex v = new Vertex(id,id);
			vertices.add(v);
			vertexArray[neighbour.getKey()] = v;
		}
		for(Entry<Byte,TreeSet<Byte>> neighbour : networkTreeMap.entrySet()) {
			for(Byte b : neighbour.getValue()) {
				String name = b.toString() + neighbour.getKey().toString();
				if(vertexArray[b] != null && vertexArray[neighbour.getKey()] != null) {
					edges.add(new Edge(name,vertexArray[neighbour.getKey()],vertexArray[b],1));
				}
			}
		}
		Graph network = new Graph(vertices, edges);
		DijkstraAlgorithm dijkstra = new DijkstraAlgorithm(network);
		return dijkstra;
	}