#NEWLINE# def dfs( self , node , visited , ret ) : #NEWLINE# #INDENT# ret . append ( node . label ) #NEWLINE# visited . add ( node ) #NEWLINE# for nei in node . neighbors : #NEWLINE# #INDENT# if ( nei not in visited ) : #NEWLINE# #INDENT# self . dfs ( nei , visited , nei )