routing

Apply deterministic routing decisions to PRD graph progression after reflect and advance steps.

Updated Apr 16, 2026
One-click install
npx skills add https://github.com/wlee075/chatbot --skill routing-wlee075
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: routing
Source: https://github.com/wlee075/chatbot/tree/main/skills/routing
Command: npx skills add https://github.com/wlee075/chatbot --skill routing-wlee075

SYSTEM DOCUMENTATION & REQUIREMENTS

What problem does it solve?

The routing logic provides deterministic decisions for the AI graph flow after reflect and advance_section, ensuring predictable progression through PRD sections and consistent handling of special cases like PASS, recovery caps, and iteration limits.

Core Features & Use Cases

  • Deterministic routing: route_after_reflect and route_after_advance functions decide the next step without mutating state.
  • Priority-based decisions: implements a clear priority order (PASS > RECOVERY_CAP > ITER_CAP > LOOP) with explicit reason codes.
  • Extensibility: supports adding new conditional edges and updated reason codes to accommodate new routing constraints.

Quick Start

Feed reflect and advance data into the routing module to obtain a deterministic next action for PRD progression.

Frequently Asked Questions about routing

High-intent search queries and answers about installing and using this skill.

FAQPage Schema
How do I make deterministic routing decisions in a PRD graph after reflection?

Deterministic routing decisions for PRD graphs are made by applying a decision table after reflect and advance steps. The routing module computes the next step using state fields like verdict and iteration without mutating state.

What priority order does deterministic routing use for PRD section progression?

Deterministic routing uses a clear priority order: PASS > RECOVERY_CAP > ITER_CAP > LOOP. Each decision emits explicit reason codes and routing_decision logs, ensuring predictable progression through PRD sections.

How does PRD graph routing handle recovery caps and iteration limits?

PRD graph routing handles recovery caps and iteration limits by evaluating recovery_mode_consecutive_count and max_iterations state fields. When caps are hit, the route_after_reflect decision table triggers forced-advance semantics to progress.

Can I add new conditional edges to an existing PRD graph routing logic?

Yes, the routing logic supports extensibility by allowing you to add new conditional edges and updated reason codes. This accommodates new routing constraints for deterministic PRD graph progression without altering core state.

Does deterministic PRD routing require any external state management dependencies?

No external state management dependencies are required. The routing module reads existing state fields such as verdict, recovery_mode_consecutive_count, iteration, and max_iterations to compute routes and emit log events.