code2llm 0.5.159__tar.gz → 0.5.161__tar.gz

{code2llm-0.5.159/code2llm.egg-info → code2llm-0.5.161}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: code2llm
-Version: 0.5.159
+Version: 0.5.161
 Summary: High-performance Python code flow analysis with optimized TOON format - CFG, DFG, call graphs, and intelligent code queries
 Home-page: https://github.com/wronai/stts
 Author: STTS Project
@@ -66,16 +66,17 @@ Dynamic: requires-python
 
 ## AI Cost Tracking
 
-![PyPI](https://img.shields.io/badge/pypi-costs-blue) ![Version](https://img.shields.io/badge/version-0.5.159-blue) ![Python](https://img.shields.io/badge/python-3.9+-blue) ![License](https://img.shields.io/badge/license-Apache--2.0-green)
-![AI Cost](https://img.shields.io/badge/AI%20Cost-$7.50-orange) ![Human Time](https://img.shields.io/badge/Human%20Time-80.7h-blue) ![Model](https://img.shields.io/badge/Model-openrouter%2Fqwen%2Fqwen3--coder--next-lightgrey)
+![PyPI](https://img.shields.io/badge/pypi-costs-blue) ![Version](https://img.shields.io/badge/version-0.5.161-blue) ![Python](https://img.shields.io/badge/python-3.9+-blue) ![License](https://img.shields.io/badge/license-Apache--2.0-green)
+![AI Cost](https://img.shields.io/badge/AI%20Cost-$7.50-orange) ![Human Time](https://img.shields.io/badge/Human%20Time-84.7h-blue) ![Model](https://img.shields.io/badge/Model-openrouter%2Fqwen%2Fqwen3--coder--next-lightgrey)
 
-- 🤖 **LLM usage:** $7.5000 (216 commits)
-- 👤 **Human dev:** ~$8072 (80.7h @ $100/h, 30min dedup)
+- 🤖 **LLM usage:** $7.5000 (230 commits)
+- 👤 **Human dev:** ~$8470 (84.7h @ $100/h, 30min dedup)
 
 Generated on 2026-05-25 using [openrouter/qwen/qwen3-coder-next](https://openrouter.ai/qwen/qwen3-coder-next)
 
 ---
 
+
 <!-- generated in 0.00s -->
 
 This directory contains the complete analysis of your project generated by `code2llm`. Each file serves a specific purpose for understanding, refactoring, and documenting your codebase.
@@ -88,7 +89,6 @@ When you run `code2llm ./ -f all`, the following files are created:
 
 | File | Format | Purpose | Key Insights |
 |------|--------|---------|--------------|
-| `planfile-tickets.yaml` | **YAML** | **🎫 Koru-ready ticket feed** - Actionable planfile suggestions from code2llm findings | Import or apply tickets for autonomous execution |
 | `evolution.toon.yaml` | **YAML** | **📋 Refactoring queue** - Prioritized improvements | 0 refactoring actions needed |
 | `map.toon.yaml` | **YAML** | **🗺️ Structural map + project header** - Modules, imports, exports, signatures, stats, alerts, hotspots, trend | Project architecture overview |
 
@@ -114,12 +114,6 @@ code2llm ./ -f toon
 # Generate all formats (what created these files)
 code2llm ./ -f all
 
-# Generate planfile suggestions and create executable tickets for Koru
-code2llm ./ -f all -o ./project --no-chunk --planfile-apply
-
-# Or import the generated manifest later
-planfile ticket import --from ./project/planfile-tickets.yaml --source code2llm
-
 # LLM-ready context only
 code2llm ./ -f context
 ```
@@ -413,10 +407,10 @@ code2llm ./ -f yaml --separate-orphans
 ---
 
 **Generated by**: `code2llm ./ -f all --readme`  
-**Analysis Date**: 2026-05-06  
-**Total Functions**: 3800  
-**Total Classes**: 259  
-**Modules**: 497  
+**Analysis Date**: 2026-05-25  
+**Total Functions**: 1312  
+**Total Classes**: 143  
+**Modules**: 427  
 
 For more information about code2llm, visit: https://github.com/tom-sapletta/code2llm
 

{code2llm-0.5.159 → code2llm-0.5.161}/README.md

@@ -2,16 +2,17 @@
 
 ## AI Cost Tracking
 
-![PyPI](https://img.shields.io/badge/pypi-costs-blue) ![Version](https://img.shields.io/badge/version-0.5.159-blue) ![Python](https://img.shields.io/badge/python-3.9+-blue) ![License](https://img.shields.io/badge/license-Apache--2.0-green)
-![AI Cost](https://img.shields.io/badge/AI%20Cost-$7.50-orange) ![Human Time](https://img.shields.io/badge/Human%20Time-80.7h-blue) ![Model](https://img.shields.io/badge/Model-openrouter%2Fqwen%2Fqwen3--coder--next-lightgrey)
+![PyPI](https://img.shields.io/badge/pypi-costs-blue) ![Version](https://img.shields.io/badge/version-0.5.161-blue) ![Python](https://img.shields.io/badge/python-3.9+-blue) ![License](https://img.shields.io/badge/license-Apache--2.0-green)
+![AI Cost](https://img.shields.io/badge/AI%20Cost-$7.50-orange) ![Human Time](https://img.shields.io/badge/Human%20Time-84.7h-blue) ![Model](https://img.shields.io/badge/Model-openrouter%2Fqwen%2Fqwen3--coder--next-lightgrey)
 
-- 🤖 **LLM usage:** $7.5000 (216 commits)
-- 👤 **Human dev:** ~$8072 (80.7h @ $100/h, 30min dedup)
+- 🤖 **LLM usage:** $7.5000 (230 commits)
+- 👤 **Human dev:** ~$8470 (84.7h @ $100/h, 30min dedup)
 
 Generated on 2026-05-25 using [openrouter/qwen/qwen3-coder-next](https://openrouter.ai/qwen/qwen3-coder-next)
 
 ---
 
+
 <!-- generated in 0.00s -->
 
 This directory contains the complete analysis of your project generated by `code2llm`. Each file serves a specific purpose for understanding, refactoring, and documenting your codebase.
@@ -24,7 +25,6 @@ When you run `code2llm ./ -f all`, the following files are created:
 
 | File | Format | Purpose | Key Insights |
 |------|--------|---------|--------------|
-| `planfile-tickets.yaml` | **YAML** | **🎫 Koru-ready ticket feed** - Actionable planfile suggestions from code2llm findings | Import or apply tickets for autonomous execution |
 | `evolution.toon.yaml` | **YAML** | **📋 Refactoring queue** - Prioritized improvements | 0 refactoring actions needed |
 | `map.toon.yaml` | **YAML** | **🗺️ Structural map + project header** - Modules, imports, exports, signatures, stats, alerts, hotspots, trend | Project architecture overview |
 
@@ -50,12 +50,6 @@ code2llm ./ -f toon
 # Generate all formats (what created these files)
 code2llm ./ -f all
 
-# Generate planfile suggestions and create executable tickets for Koru
-code2llm ./ -f all -o ./project --no-chunk --planfile-apply
-
-# Or import the generated manifest later
-planfile ticket import --from ./project/planfile-tickets.yaml --source code2llm
-
 # LLM-ready context only
 code2llm ./ -f context
 ```
@@ -349,10 +343,10 @@ code2llm ./ -f yaml --separate-orphans
 ---
 
 **Generated by**: `code2llm ./ -f all --readme`  
-**Analysis Date**: 2026-05-06  
-**Total Functions**: 3800  
-**Total Classes**: 259  
-**Modules**: 497  
+**Analysis Date**: 2026-05-25  
+**Total Functions**: 1312  
+**Total Classes**: 143  
+**Modules**: 427  
 
 For more information about code2llm, visit: https://github.com/tom-sapletta/code2llm
 

code2llm-0.5.161/VERSION

@@ -0,0 +1 @@
+0.5.161

{code2llm-0.5.159 → code2llm-0.5.161}/code2llm/__init__.py

@@ -8,7 +8,7 @@ Includes NLP Processing Pipeline for query normalization, intent matching,
 and entity resolution with multilingual support.
 """
 
-__version__ = "0.5.159"
+__version__ = "0.5.161"
 __author__ = "STTS Project"
 
 # Core analysis components (lightweight, always needed)

{code2llm-0.5.159 → code2llm-0.5.161}/code2llm/analysis/_data_impl.py

@@ -4,6 +4,26 @@ Extracted to keep data_analysis.py under the MI hard-gate threshold.
 All functions here are module-private (leading underscore) and called
 exclusively from DataAnalyzer in data_analysis.py.
 """
+# ── Data pipeline helpers ─────────────────────────────────────────────────────
+# _find_data_pipelines()   : detect sequential transform chains from call graph.
+# ── State-machine helpers ─────────────────────────────────────────────────────
+# _is_state_func()         : heuristic; True if name contains state keyword.
+# _state_affected_by()     : callers that mutate the given function's state.
+# _find_state_patterns()   : aggregate state-machine detections per module.
+# ── Data-dependency helpers ───────────────────────────────────────────────────
+# _find_data_dependencies() : build producer→consumer edges from shared types.
+# ── Event-flow helpers ────────────────────────────────────────────────────────
+# _is_event_func()         : heuristic; True if name contains event keyword.
+# _event_handlers()        : functions that consume outputs of an event source.
+# _find_event_flows()      : aggregate event-flow detections across the project.
+# ── Type-inference helpers ────────────────────────────────────────────────────
+# _detect_types_from_name(): keyword-match on function name + docstring.
+# _create_type_entry()     : initialise a type-usage dict entry.
+# _update_type_stats()     : accumulate consumed/produced counts per type.
+# _infer_parameter_types() : extract type hints from function parameters.
+# _infer_return_types()    : extract type hints from function return annotation.
+# _analyze_data_types()    : top-level driver; returns list of type-usage entries.
+# _get_function_data_types(): merge name-based + annotation-based type signals.
 
 from typing import Any, Dict, List
 from code2llm.core.models import AnalysisResult
@@ -42,32 +62,38 @@ def _find_data_pipelines(result: AnalysisResult, categorize_fn, make_stage_fn, m
     return pipelines
 
 
+_STATE_INDICATORS = ["state", "status", "mode", "phase", "lifecycle", "session", "context"]
+_TRANSITION_INDICATORS = ["transition", "change", "update", "set_state", "switch"]
+
+
+def _is_state_func(name_lower: str) -> bool:
+    """Return True if the function name suggests state management."""
+    return any(ind in name_lower for ind in _STATE_INDICATORS + _TRANSITION_INDICATORS)
+
+
+def _state_affected_by(func, functions: dict) -> list:
+    """Return calls that look like state-managing functions."""
+    return [
+        call for call in list(func.calls)[:10]
+        if (cf := functions.get(call)) and any(ind in cf.name.lower() for ind in _STATE_INDICATORS)
+    ]
+
+
 def _find_state_patterns(result: AnalysisResult) -> list:
     """Find state management patterns."""
     patterns: list = []
-    state_indicators = ["state", "status", "mode", "phase", "lifecycle", "session", "context"]
-    transition_indicators = ["transition", "change", "update", "set_state", "switch"]
-
     for func_name, func in result.functions.items():
         name_lower = func.name.lower()
-        if any(ind in name_lower for ind in state_indicators + transition_indicators):
-            affected_states = []
-            for call in list(func.calls)[:10]:
-                call_func = result.functions.get(call)
-                if call_func and any(ind in call_func.name.lower() for ind in state_indicators):
-                    affected_states.append(call)
-            patterns.append(
-                {
-                    "function": func_name,
-                    "type": "state_manager"
-                    if "set" in name_lower or "update" in name_lower
-                    else "state_reader",
-                    "affects_states": affected_states[:5],
-                    "description": func.docstring[:150] if func.docstring else "N/A",
-                }
-            )
-            if len(patterns) >= 20:
-                break
+        if not _is_state_func(name_lower):
+            continue
+        patterns.append({
+            "function": func_name,
+            "type": "state_manager" if ("set" in name_lower or "update" in name_lower) else "state_reader",
+            "affects_states": _state_affected_by(func, result.functions)[:5],
+            "description": func.docstring[:150] if func.docstring else "N/A",
+        })
+        if len(patterns) >= 20:
+            break
     return patterns
 
 
@@ -95,33 +121,43 @@ def _find_data_dependencies(result: AnalysisResult) -> list:
     return deps[:15]
 
 
+_EVENT_INDICATORS = ["event", "emit", "trigger", "notify", "callback", "handler", "listen", "subscribe"]
+_HOOK_INDICATORS = ["hook", "on_", "before_", "after_", "pre_", "post_"]
+_EVENT_HANDLER_WORDS = _EVENT_INDICATORS + ["handle", "process"]
+
+
+def _is_event_func(name_lower: str) -> bool:
+    """Return True if the function name suggests event handling or emission."""
+    return any(ind in name_lower for ind in _EVENT_INDICATORS) or any(
+        name_lower.startswith(ind) for ind in _HOOK_INDICATORS
+    )
+
+
+def _event_handlers(func, functions: dict) -> list:
+    """Return list of called functions that look like event handlers."""
+    result = []
+    for called in list(func.calls)[:10]:
+        cf = functions.get(called)
+        if cf and any(ind in cf.name.lower() for ind in _EVENT_HANDLER_WORDS):
+            result.append(called)
+    return result
+
+
 def _find_event_flows(result: AnalysisResult) -> list:
     """Find event-driven patterns."""
     flows: list = []
-    event_indicators = ["event", "emit", "trigger", "notify", "callback", "handler", "listen", "subscribe"]
-    hook_indicators = ["hook", "on_", "before_", "after_", "pre_", "post_"]
     for func_name, func in result.functions.items():
         name_lower = func.name.lower()
-        if any(ind in name_lower for ind in event_indicators) or any(
-            name_lower.startswith(ind) for ind in hook_indicators
-        ):
-            handlers = []
-            for called in list(func.calls)[:10]:
-                called_func = result.functions.get(called)
-                if called_func and any(
-                    ind in called_func.name.lower() for ind in event_indicators + ["handle", "process"]
-                ):
-                    handlers.append(called)
-            flows.append(
-                {
-                    "event_source": func_name,
-                    "type": "emitter" if "emit" in name_lower or "trigger" in name_lower else "handler",
-                    "handlers": handlers[:5],
-                    "description": func.docstring[:150] if func.docstring else "N/A",
-                }
-            )
-            if len(flows) >= 20:
-                break
+        if not _is_event_func(name_lower):
+            continue
+        flows.append({
+            "event_source": func_name,
+            "type": "emitter" if ("emit" in name_lower or "trigger" in name_lower) else "handler",
+            "handlers": _event_handlers(func, result.functions)[:5],
+            "description": func.docstring[:150] if func.docstring else "N/A",
+        })
+        if len(flows) >= 20:
+            break
     return flows
 
 
@@ -222,26 +258,26 @@ def _analyze_data_types(result: AnalysisResult) -> list:
 # ---------------------------------------------------------------------------
 
 
+_NAME_TYPE_KEYWORDS: List[tuple] = [
+    ("list", ("list", "items")),
+    ("dict", ("dict", "map")),
+    ("str",  ("text", "string")),
+    ("int",  ("count", "index")),
+]
+_DOC_TYPE_KEYWORDS: List[tuple] = [
+    ("list", ("list",)),
+    ("dict", ("dict",)),
+    ("str",  ("string", "text")),
+]
+
+
 def _get_function_data_types(func) -> list:
     """Derive data type labels for a function from its name and docstring."""
-    types: List[str] = []
     name = func.name.lower()
-    if "list" in name or "items" in name:
-        types.append("list")
-    if "dict" in name or "map" in name:
-        types.append("dict")
-    if "text" in name or "string" in name:
-        types.append("str")
-    if "count" in name or "index" in name:
-        types.append("int")
+    types = [dt for dt, kws in _NAME_TYPE_KEYWORDS if any(kw in name for kw in kws)]
     if func.docstring:
         doc = func.docstring.lower()
-        if "list" in doc:
-            types.append("list")
-        if "dict" in doc:
-            types.append("dict")
-        if "string" in doc or "text" in doc:
-            types.append("str")
+        types += [dt for dt, kws in _DOC_TYPE_KEYWORDS if any(kw in doc for kw in kws)]
     return list(set(types))
 
 
@@ -306,55 +342,51 @@ def _identify_process_patterns(result: AnalysisResult) -> list:
     return sorted(res, key=lambda x: x["count"], reverse=True)
 
 
-def _analyze_optimization_opportunities(
-    result: AnalysisResult, data_types: list, dfg: dict
-) -> dict:
-    """Analyze optimization opportunities in data handling."""
-    opt: Dict[str, Any] = {
-        "potential_score": 0.0,
-        "type_consolidation": [],
-        "process_consolidation": [],
-        "hub_optimization": [],
-        "recommendations": [],
-    }
+def _type_consolidations(data_types: list) -> list:
+    """Find groups of similar data types that could be consolidated."""
     similar: Dict[str, list] = {}
     for dt in data_types:
         sig = ",".join(sorted(dt["detected_types"]))
-        if sig not in similar:
-            similar[sig] = []
-        similar[sig].append(dt)
-    for _sig, sims in similar.items():
+        similar.setdefault(sig, []).append(dt)
+    result = []
+    for sig, sims in similar.items():
         if len(sims) > 1:
             usage = sum(s["usage_count"] for s in sims)
             if usage > 10:
-                opt["type_consolidation"].append(
-                    {
-                        "type_signature": _sig,
-                        "similar_types": [s["type_name"] for s in sims],
-                        "total_usage": usage,
-                        "potential_reduction": len(sims) - 1,
-                    }
-                )
-    for p in _identify_process_patterns(result):
-        if p["count"] > 5:
-            opt["process_consolidation"].append(
-                {
-                    "pattern_type": p["pattern_type"],
-                    "function_count": p["count"],
-                    "potential_reduction": p["count"] // 3,
-                }
-            )
-    for hub in [n for n in dfg["nodes"].values() if n["is_hub"]][:10]:
-        opt["hub_optimization"].append(
-            {
-                "function": hub["id"],
-                "connections": hub["in_degree"] + hub["out_degree"],
-                "optimization_type": "split" if hub["out_degree"] > 10 else "cache",
-            }
-        )
-    opt["potential_score"] = (
-        len(opt["type_consolidation"]) * 10
-        + len(opt["process_consolidation"]) * 15
-        + len(opt["hub_optimization"]) * 5
-    ) / 100.0
-    return opt
+                result.append({"type_signature": sig, "similar_types": [s["type_name"] for s in sims],
+                                "total_usage": usage, "potential_reduction": len(sims) - 1})
+    return result
+
+
+def _process_consolidations(result: AnalysisResult) -> list:
+    """Find repeated process patterns that could be consolidated."""
+    return [
+        {"pattern_type": p["pattern_type"], "function_count": p["count"],
+         "potential_reduction": p["count"] // 3}
+        for p in _identify_process_patterns(result) if p["count"] > 5
+    ]
+
+
+def _hub_optimizations(dfg: dict) -> list:
+    """Identify hub nodes that are candidates for splitting or caching."""
+    return [
+        {"function": hub["id"], "connections": hub["in_degree"] + hub["out_degree"],
+         "optimization_type": "split" if hub["out_degree"] > 10 else "cache"}
+        for hub in list(n for n in dfg["nodes"].values() if n["is_hub"])[:10]
+    ]
+
+
+def _analyze_optimization_opportunities(
+    result: AnalysisResult, data_types: list, dfg: dict
+) -> dict:
+    """Analyze optimization opportunities in data handling."""
+    type_cons = _type_consolidations(data_types)
+    proc_cons = _process_consolidations(result)
+    hub_opts = _hub_optimizations(dfg)
+    return {
+        "potential_score": (len(type_cons) * 10 + len(proc_cons) * 15 + len(hub_opts) * 5) / 100.0,
+        "type_consolidation": type_cons,
+        "process_consolidation": proc_cons,
+        "hub_optimization": hub_opts,
+        "recommendations": [],
+    }

{code2llm-0.5.159 → code2llm-0.5.161}/code2llm/analysis/call_graph.py

@@ -204,4 +204,5 @@ class CallGraphExtractor(ast.NodeVisitor):
         return None
 
     def _expr_to_str(self, node: ast.AST) -> str:
+        """Unparse an AST expression node to a source string (empty string on failure)."""
         return ast_unparse(node, default_none="")

{code2llm-0.5.159 → code2llm-0.5.161}/code2llm/analysis/cfg.py

@@ -125,7 +125,6 @@ class CFGExtractor(ast.NodeVisitor):
         # Visit then branch
         then_last = []
         for stmt in node.body:
-            prev = self.current_node
             self.current_node = branch_entry
             self.visit(stmt)
             then_last.append(self.current_node)
@@ -136,7 +135,6 @@ class CFGExtractor(ast.NodeVisitor):
         if node.orelse:
             branch_entry = cond_node
             for stmt in node.orelse:
-                prev = self.current_node
                 self.current_node = branch_entry
                 self.visit(stmt)
                 else_last.append(self.current_node)
@@ -270,10 +268,11 @@ class CFGExtractor(ast.NodeVisitor):
         """Extract condition as string."""
         try:
             return ast.unparse(node) if hasattr(ast, "unparse") else str(node)[:50]
-        except:
+        except Exception:
             return str(node)[:50]
 
     def _expr_to_str(self, node: ast.AST) -> str:
+        """Unparse an AST expression node to a source string."""
         return ast_unparse(node)
 
     def _format_except(self, handler: ast.ExceptHandler) -> str:

{code2llm-0.5.159 → code2llm-0.5.161}/code2llm/analysis/coupling.py

@@ -8,6 +8,7 @@ class CouplingAnalyzer:
     """Analyze coupling between modules."""
 
     def __init__(self, result: AnalysisResult):
+        """Initialise with the analysis result to analyse for coupling."""
         self.result = result
 
     def analyze(self) -> Dict[str, Any]:

{code2llm-0.5.159 → code2llm-0.5.161}/code2llm/analysis/dfg.py

@@ -230,6 +230,7 @@ class DFGExtractor(ast.NodeVisitor):
         return names
 
     def _expr_to_str(self, node: ast.AST) -> str:
+        """Unparse an AST expression node to a source string."""
         return ast_unparse(node)
 
     def _build_data_flow_edges(self):

{code2llm-0.5.159 → code2llm-0.5.161}/code2llm/analysis/pipeline_detector.py

@@ -191,6 +191,22 @@ class PipelineDetector:
     # ------------------------------------------------------------------
     # path finding
     # ------------------------------------------------------------------
+    def _process_components(
+        self, graph: nx.DiGraph, paths: List[List[str]], used_nodes: Set[str]
+    ) -> None:
+        """Extend paths with longest paths from each weakly connected component."""
+        for component in nx.weakly_connected_components(graph):
+            if len(component) < MIN_PIPELINE_LENGTH:
+                continue
+            if len(component & used_nodes) > len(component) * 0.5:
+                continue
+            path = self._longest_path_in_dag(graph.subgraph(component))
+            if len(path) >= MIN_PIPELINE_LENGTH:
+                new_overlap = sum(1 for n in path if n in used_nodes)
+                if new_overlap <= len(path) * 0.5:
+                    paths.append(path)
+                    used_nodes.update(path)
+
     def _find_pipeline_paths(self, graph: nx.DiGraph) -> List[List[str]]:
         """Find longest paths in the call graph as pipeline candidates.
 
@@ -200,41 +216,17 @@ class PipelineDetector:
         3. For each source, find longest simple path to any sink
         4. Also consider longest paths in each weakly connected component
         """
-        paths: List[List[str]] = []
-
-        # Get source nodes (in-degree 0) as potential pipeline entry points
         sources = [n for n in graph.nodes() if graph.in_degree(n) == 0]
-
-        # If no natural sources, use nodes with low in-degree
         if not sources:
             sources = sorted(graph.nodes(), key=lambda n: graph.in_degree(n))[:5]
-
-        # Try to find longest paths from each source
+        paths: List[List[str]] = []
         used_nodes: Set[str] = set()
         for source in sources:
             best_path = self._longest_path_from(graph, source, used_nodes)
             if len(best_path) >= MIN_PIPELINE_LENGTH:
                 paths.append(best_path)
                 used_nodes.update(best_path)
-
-        # Also try: for each weakly connected component, find the longest path
-        for component in nx.weakly_connected_components(graph):
-            if len(component) < MIN_PIPELINE_LENGTH:
-                continue
-            # Skip if heavily overlapping with existing paths
-            overlap = len(component & used_nodes)
-            if overlap > len(component) * 0.5:
-                continue
-
-            subgraph = graph.subgraph(component)
-            path = self._longest_path_in_dag(subgraph)
-            if len(path) >= MIN_PIPELINE_LENGTH:
-                # Check overlap with existing paths
-                new_overlap = sum(1 for n in path if n in used_nodes)
-                if new_overlap <= len(path) * 0.5:
-                    paths.append(path)
-                    used_nodes.update(path)
-
+        self._process_components(graph, paths, used_nodes)
         return paths
 
     def _longest_path_from(