original_docstring:  explore a graph in depth first mode,
  		explore the graph from the given node and calculate 
  		longest path to leafs from the starting node (recursive) 
docstring: explore a graph in depth first mode,
  explore the graph from the given node and calculate
  longest path to leafs from the starting node (recursive)
docstring_tokens: explore a graph in depth first mode explore the graph from the given node and calculate longest path to leafs from the starting node ( recursive )
code: def longest_path(self, node):
  		''' explore a graph in depth first mode,
  		explore the graph from the given node and calculate 
  		longest path to leafs from the starting node (recursive) '''
  		longest, current = [0], 0
  		self.__routine_longest_path(node, current, longest)
  		return longest[0]
code_tokens: def longest_path ( self , node ) : longest , current = [ 0 ] , 0 self . __routine_longest_path ( node , current , longest ) return longest [ 0 ]
short_docstring: explore a graph in depth first mode,
  explore the graph from the given node and calculate
  longest path to leafs from the starting node (recursive)
short_docstring_tokens: explore a graph in depth first mode explore the graph from the given node and calculate longest path to leafs from the starting node ( recursive )
comment: ''' explore a graph in depth first mode,
  		explore the graph from the given node and calculate 
  		longest path to leafs from the starting node (recursive) '''