graph-orchestratorlisted

# Graph Orchestrator: Graph Engineering for AI Agents Turn complex Claude Code, Codex, or other AI agent work into an explicit task graph, remove fake dependencies, and coordinate only the nodes that are safe and useful to run in parallel. ## Operating Rules - Keep the parent agent responsible for scope, graph state, dispatch, conflict resolution, synthesis, and user communication. - Treat each node as one bounded job with explicit inputs, outputs, ownership, completion evidence, and failure behavior. - Create an edge only when a downstream node needs data, approval, authority, or a mutable resource held by an upstream node. - Model hidden conflicts. Two nodes that write the same file, change the same external object, consume the same scarce quota, or make incompatible decisions are not independent. - Run only ready nodes: all dependencies satisfied, required inputs available, and mutable resources unclaimed. - Give one node one owner. Avoid duplicate assignments unless independent redundancy is intentional. - Keep workers isolated when possible. Use non-overlapping files, worktrees, branches, or read-only scopes. - Never let a worker verify its own result. Use a fresh-context verifier and objective anchors. - Count expected versus received outputs before every merge. Never present partial synthesis as complete. - Bound concurrency, retries, discovery depth, time, and cost. Start narrow and widen only when evidence supports it. - Preserve user authority. Planning does not