Solution: Print all Connected Components of a Graph

#include "Graph.h"
void Graph::utilityFunction(int v, vector <bool>& visited) {
  visited[v] = true;
  cout << v << " ";
  list <int> ::iterator i;
  for (i = adjacencyList[v].begin(); i != adjacencyList[v].end(); ++i)
    if (!visited[ * i])
      utilityFunction( * i, visited);
}
void Graph::printConnectedComponents() {
  vector <bool> visited(this -> vertices, false);
  for (int v = 0; v < this -> vertices; v++) {
    if (visited[v] == false) {
      utilityFunction(v, visited);
      cout << endl;
    }
  }
}
int main() {
  Graph g(7);
  g.addEdge(0, 1);
  g.addEdge(1, 2);
  g.addEdge(3, 4);
  g.addEdge(5, 3);
  g.addEdge(5, 6);
  g.addEdge(3, 6);
  cout << "The connected components are:" << endl;
  g.printConnectedComponents();
  return 0;
}