Traverse adjacency list of v and print only those adjacent which have vDegree >= k after BFS .
list < int > :: iterator itr ; for ( itr = adj [ v ] . begin ( ) ; itr != adj [ v ] . end ( ) ; ++ itr ) if ( vDegree [ * itr ] >= k ) cout << " ▁ - > ▁ " << * itr ; } } }