---
name: yogsoth-ai/cycle-detection
source: https://app.decimal.ai/s/yogsoth-ai-cycle-detection@1/SKILL.md
source_sha256: 2e3e97f8b1fd
---

# Cycle Detection

Scans a pairwise comparison matrix for preference cycles (A>B>C>A) and computes transitivity metrics. Identifies all minimal cycles and quantifies overall consistency.

## Execution

Runs as a subagent. Receives a comparison matrix, returns all detected cycles and transitivity scores.

## Why Subagent

Cycle detection requires graph traversal algorithms (Johnson's algorithm or DFS-based enumeration) applied to the preference digraph. Isolating this keeps algorithmic complexity out of the orchestrator.

## HARD-GATE

Output MUST contain a `cycles` array (empty if none found) and a numeric `transitivity_score` in [0, 1]. All reported cycles MUST be verifiable against the input matrix.

<!-- BEGIN available-tables (generated) -->

## Available SOPs

Optional, no fixed order; the final leaf is always a sop.

| SOP | When to use |
| --- | --- |
| spawn-agent | Spawn a customized CC subagent with full MCP tool access. Used by SOPs that declare execution: subagent. |

<!-- END available-tables (generated) -->