public void recursiveBFS(String label) {

		Vertex v = getVertex(label);
		if (v.wasVisited() == false) {
			v.setVisited(true);
			this.queueOfNodes.add(v);
			System.out.println("Visited vertex : " + v);
		}
		int r = getVertexIndex(label);
		for (int i = 0; i < this.COLS; i++) {

			if (graph[r][i] == 1) {

				Vertex t = this.vertices[i];
				if (t.wasVisited() == false) {
					t.setVisited(true);
					this.queueOfNodes.add(t);
					System.out.println("Visited vertex : " + t);
				}
			}
		}
		this.queueOfNodes.poll();
		if (queueOfNodes.isEmpty())
			return;
		this.recursiveBFS(this.queueOfNodes.peek().getLabel());
	}