find_circular
Detect circular dependencies in static import graphs. Returns cycles sorted by longest first, with pagination support. If index is stale, re-index and retry.
Instructions
Detect circular dependencies (cycles A → B → C → A) in the static import graph. Prefer this over manually grepping for import chains — Reflex does the cycle detection directly. Returns {pagination, results: [{paths: ["a.rs", "b.rs", "a.rs"]}]}, sorted with longest cycles first by default. Default page size 200; if pagination.has_more is true, fetch the next page with offset. Only static imports are considered. On "Index not found" / "stale" error, call index_project, then retry.
Input Schema
TableJSON Schema
| Name | Required | Description | Default |
|---|---|---|---|
| sort | No | Sort order: 'asc' (shortest cycles first) or 'desc' (longest cycles first, default) | |
| limit | No | Maximum number of cycles per page (default: 200) | |
| offset | No | Pagination offset (skip first N cycles). Use with limit for pagination. |