public boolean searchRecursively(Integer element, Integer target) {
		if(element == target) {
			System.out.println("Start : ");
			solution = "Start : ";
			return true;
		}
		visited[element] = 1;
		for(int j = 0; j < verticesNumber; j++) {
			if(edges[element][j] == 1 && visited[j] == 0) {
				if(searchRecursively(j, target) == true) {
					System.out.print(j + ", ");
					solution += j + ", ";
					return true;
				}
			}
			
		}
		return false;
	}