Remove redundant iterators in referenceless

Author: Donaim

micall/utils/referenceless_contig_stitcher.py

@@ -302,7 +302,7 @@ def filter_extensions(existing: MutableMapping[str, ContigsPath],
     yield from ret.values()
 
 
-def calculate_all_paths(contigs: Sequence[ContigWithAligner]) -> Iterator[ContigsPath]:
+def calculate_all_paths(contigs: Sequence[ContigWithAligner]) -> SortedList[ContigsPath]:
     max_acceptable_prob = MaximumAcceptableProbability.empty()
     existing: MutableMapping[str, ContigsPath] = {}
     finder = OverlapFinder.make('ACTG')
@@ -313,7 +313,6 @@ def calculate_all_paths(contigs: Sequence[ContigWithAligner]) -> Iterator[Contig
     logger.debug("Calculating all paths...")
     cycle = 1
     while paths:
-        yield from paths
         logger.debug("Cycle %s started with %s paths.", cycle, len(paths))
 
         calc_multiple_extensions(finder, max_acceptable_prob, paths, contigs)
@@ -328,12 +327,12 @@ def calculate_all_paths(contigs: Sequence[ContigWithAligner]) -> Iterator[Contig
                          cycle, len(paths), size, parts)
 
         cycle += 1
-        yield from paths
+
+    return max_acceptable_prob.paths
 
 
 def find_most_probable_path(contigs: Sequence[ContigWithAligner]) -> ContigsPath:
-    paths = calculate_all_paths(contigs)
-    return max(paths)
+    return calculate_all_paths(contigs)[-1]
 
 
 def stitch_consensus(contigs: Iterable[ContigWithAligner]) -> Iterator[ContigWithAligner]: