parameters: (self, node1, node2, path=[])
return_statement: return None
docstring: Find any path between node1 and node2 (may not be shortest)
docstring_summary: Find any path between node1 and node2 (may not be shortest)
docstring_tokens: Find any path between node1 and node2 ( may not be shortest )
function: def find_path(self, node1, node2, path=[]):
          """ Find any path between node1 and node2 (may not be shortest) """
  
          path = path + [node1]
          if node1 == node2:
              return path
          if node1 not in self._graph:
              return None
          for node in self._graph[node1]:
              if node not in path:
                  new_path = self.find_path(node, node2, path)
                  if new_path:
                      return new_path
          return None
function_tokens: def find_path ( self , node1 , node2 , path = [ ] ) : path = path + [ node1 ] if node1 == node2 : return path if node1 not in self . _graph : return None for node in self . _graph [ node1 ] : if node not in path : new_path = self . find_path ( node , node2 , path ) if new_path : return new_path return None