cos_graph_cycles
Detect circular dependencies in code by scanning import or call graphs for strongly-connected components. Return cycles with configurable limits and minimum size to identify dependency loops for refactoring.
Instructions
Detect circular dependencies as strongly-connected components.
Args: scope: "imports" (module-level circular deps, the design smell) or "calls" (function cycles incl. legitimate mutual recursion). top: Max cycles returned (default 20). min_size: Minimum SCC size to report (default 2).
Returns:
JSON envelope with cycles (each {size, members}) + total_count.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| top | No | ||
| scope | No | imports | |
| min_size | No |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
| result | Yes |