works

networkx/algorithms/simple_paths.py

@@ -351,7 +351,10 @@ def _all_simple_paths_multigraph(G, source, targets, cutoff):
             if child in visited:
                 continue
             if child in targets:
-                yield list(visited) + [child]
+                path = list(visited) + [child]
+                if _path_under_cutoff(G, path, cutoff):
+                    yield path
+
             visited[child] = True
             if targets - set(visited.keys()):
                 stack.append((v for u, v in G.edges(child)))
@@ -477,7 +480,7 @@ def _all_simple_edge_paths_multigraph(G, source, targets, cutoff):
         if cutoff.get(None, 1) < 1:
             return []
     else:
-        raise TypeError("cutoff should either be int or dict")
+        raise TypeError("cutoff should be either int or dict")
 
     visited = [source]
     stack = [iter(G.edges(source, keys=True))]
@@ -490,18 +493,20 @@ def _all_simple_edge_paths_multigraph(G, source, targets, cutoff):
             visited.pop()
         elif _path_under_cutoff(G, visited, cutoff):
             if child[1] in targets:
-                path = visited[1:] + [child]
+                edge_path = visited[1:] + [child]
+                path = [u for u, v, k in edge_path] + [edge_path[-1][1]]
                 if _path_under_cutoff(G, path, cutoff):
-                    yield path
+                    yield edge_path
             elif child[1] not in [v[0] for v in visited[1:]]:
                 visited.append(child)
                 stack.append(iter(G.edges(child[1], keys=True)))
         else:  # len(visited) == cutoff:
             for u, v, k in [child] + list(children):
                 if v in targets:
-                    path = visited[1:] + [(u, v, k)]
+                    edge_path = visited[1:] + [(u, v, k)]
+                    path = [u for u, v, k in edge_path] + edge_path[-1][1]
                     if _path_under_cutoff(G, path, cutoff):
-                        yield path
+                        yield edge_path
             stack.pop()
             visited.pop()