code: def find_all_path(graph, start, end, path=[]):
      """
      Find all paths between two nodes using recursion and backtracking
      """
      path = path + [start]
      if start == end:
          return [path]
      if not start in graph:
          return []
      paths = []
      for node in graph[start]:
          if node not in path:
              newpaths = find_all_path(graph, node, end, path)
              for newpath in newpaths:
                  paths.append(newpath)
      return paths
  
label_desc: Use image node_id 2 for calling a global function with example usage: find_all_path(graph, start, end, path) and returns: paths, list, list