Traverse adjacency list of v and print only those adjacent which have vvDegree >= k after DFS
for i in self . graph [ v ] : NEW_LINE INDENT if vDegree [ i ] >= k : NEW_LINE INDENT print " - > ▁ " + str ( i ) , NEW_LINE DEDENT DEDENT