Get all adjacent vertices of the dequeued vertex s . If a adjacent has not been visited ( level [ i ] < '0' ) , then update level [ i ] = = parent_level [ s ] + 1 and enqueue it
for ( i = adj [ s ] . begin ( ) ; i != adj [ s ] . end ( ) ; ++ i ) {