def METHOD_NAME(self, graph, current_i, j, current_path):
    nb = graph[current_i]
    for n in nb:
        if n not in self.visited:
            self.visited.append(n)
            if n == j:
                return current_path + [j]
            else:
                r = self.METHOD_NAME(graph, n, j, current_path + [n])
                if r:
                    return r