Removing an edge while traversing a directed graph

See more:

C++

graph

Hello everyone,

I want to erase an element from adjacency list (this is a digraph) if the element is equal to the vertex passed to the function (in this case, if it is equal to 'u'). I want to do it while traversing the graph (using BFS). Does anyone know how I can do it?

Here is the code I'm using to traverse the graph (BFS) and erase the edges. But it doesn't do the job properly:

void Graph::BFS(int u) {
	int w;
	bool *visited = new bool[V];
	queue<int> q;
    visited[u] = true;
    q.push(u);

    while(!q.empty()) {
    	w = q.front();
    	cout << w << " ";
    	q.pop();
    	list<int>::iterator i;

    	for(i=adj[w].begin(); i!= adj[w].end(); ) {
    		if(!visited[*i]) {
    			if(u == *i)
    				adj[w].erase(i++);
			visited[*i] = true;
			q.push(*i);
			++i;
			}
    		++i;
	        }
    }
}

Global variables used in BFS function:
int V; //Number of vertices
list<int> *adj; //Pointer to an array containing adjacency lists


What I have tried:

I tested my code on following Graph:

0->0 , 0->1 , 0->2, 1->2, 2->3, 3->3

My code does the job correctly when I start from 0 or 1, but trapped in an infinite loop (probably) when I pass 2 or 3 to the BFS.