A recursive function to call DFS starting from v . It returns true if vDegree of v after processing is less than k else false It also updates vDegree of adjacent if vDegree of v is less than k . And if vDegree of a processed adjacent becomes less than k , then it reduces of vDegree of v also ,
def DFSUtil ( self , v , visited , vDegree , k ) : NEW_LINE