int numVertices;

list<int>* adjLists;

bool* visited;

public:

Graph(int vertices);

void addEdge(int src, int dest);

void BFS(int startVertex);

visited = new bool[numVertices];

for (int i = 0; i < numVertices; i++)

visited[i] = false;

list<int> queue;

visited[startVertex] = true;

queue.push_back(startVertex);

list<int>::iterator i;

while (!queue.empty()) {

int currVertex = queue.front();

cout << "Visited " << currVertex << " "<<"\n";

queue.pop_front();

for (i = adjLists[currVertex].begin(); i != adjLists[currVertex].end(); ++i) {

int adjVertex = *i;

if (!visited[adjVertex]) {

visited[adjVertex] = true;

queue.push_back(adjVertex);

}

}

}

cout <<"START VERTEX:";

cout << startVertex << " ";

Graph g(15);

g.addEdge(1, 2);

g.addEdge(1, 3);

g.addEdge(1, 4);

g.addEdge(2, 5);

g.addEdge(2, 6);

g.addEdge(5, 9);

g.addEdge(5, 10);g.addEdge(4, 7);g.addEdge(4, 8);g.addEdge(7, 11);

g.addEdge(7, 12);

g.BFS(2);

return 0;