public void dfs(int vertex) {
		visited[vertex] = 1;
		componentIDs[vertex] = id;

		ArrayList<Integer> neighbors = graph.getAdjacenctVertices(vertex);

		for (int i : neighbors) {
			if (visited[i] == 0) {
				dfs(i);
			}
		}

		visited[vertex] = 2;
	}