original_docstring:  explore a graph in depth first mode,
  		explore the tree from the given node and check if
  		there is a path at least long length (recursive) 
docstring: explore a graph in depth first mode,
  explore the tree from the given node and check if
  there is a path at least long length (recursive)
docstring_tokens: explore a graph in depth first mode explore the tree from the given node and check if there is a path at least long length ( recursive )
code: def path_check(self, node, length):
  		''' explore a graph in depth first mode,
  		explore the tree from the given node and check if
  		there is a path at least long length (recursive) '''
  		current, check = 0, [0]
  		self.__routine_path_check(node, current, length, check)
  		return bool(check[0])
code_tokens: def path_check ( self , node , length ) : current , check = 0 , [ 0 ] self . __routine_path_check ( node , current , length , check ) return bool ( check [ 0 ] )
short_docstring: explore a graph in depth first mode,
  explore the tree from the given node and check if
  there is a path at least long length (recursive)
short_docstring_tokens: explore a graph in depth first mode explore the tree from the given node and check if there is a path at least long length ( recursive )
comment: ''' explore a graph in depth first mode,
  		explore the tree from the given node and check if
  		there is a path at least long length (recursive) '''