cg

cg is a command for Claude Code from widnyana/eyay-toolkits. It costs 13 tokens per session (553 once invoked), scanned A, original, MIT.

A command that creates a call graph, a map showing which functions call or pass data to other functions, in Graph Protocol format.

In plain words
What is it for?
Use it to map existing code or sketch a proposed task, document boundaries and behavior, and identify how to test the design without changing the code.
Why use it?
It helps make a program's structure, data flow, dependencies, errors, retries, and resource handling visible in one consistent diagram.

Command for Claude Code

Written for Claude Code: argument-hint in frontmatter.

Part of the design-thinking plugin — 5 commands shipped together

Good fit Use it to map existing code or sketch a proposed task, document…

Compare 6 commands from other repositories ↓
Install with agentmods
npx agentmods add commands/widnyana/eyay-toolkits/cg
Install

Getting it into your agent

One page per mod, every tool's command on it. A separate URL per tool would split the same page into five that compete with each other.

Clone the repo
git clone --depth 1 https://github.com/widnyana/eyay-toolkits

Made for: Claude Code.

Or install design-thinking, the plugin that ships this one along with the rest of its 5 commands.

Wrote this? Show the measurements

A badge with what this costs and how it scanned, read live from this page, so it follows the numbers instead of freezing them. Markdown for a README, HTML for a documentation site or a project page.

agentmods badge for cg

README.md
[![agentmods](https://agentmods.dev/badge/commands/widnyana/eyay-toolkits/cg.svg)](https://agentmods.dev/commands/widnyana/eyay-toolkits/cg)
Your own site
<a href="https://agentmods.dev/commands/widnyana/eyay-toolkits/cg"><img src="https://agentmods.dev/badge/commands/widnyana/eyay-toolkits/cg.svg" alt="Measured on agentmods" height="20"></a>
Per session 13 Only the description is in the session, so the agent can decide to use it. The body loads when it is invoked.
When invoked 553 The whole file, excluding the scripts and references it only reads on demand.
Security scan A 0 findings. A grade says what 26 rules found in the file — not that it is safe.
Origin original No closer match found in the catalogue.
Token cost

What it costs to keep this loaded

Counted locally with the o200k_base tokenizer, which is exact for GPT models; Claude uses its own tokenizer and its counts differ. Treat this as one consistent yardstick across the catalogue rather than a bill. Prices are per million input tokens.

ModelPer sessionOnce invoked
Fable 5.1 $0.00013 $0.00553
Opus 5 $0.00006 $0.00277
Sonnet 5 $0.00003 $0.00111
Haiku 4.5 $0.00001 $0.00055

Measured 7d ago against content hash a2481df54293, method: parsed. Prices are Anthropic first-party input rates as of 2026-09-07, from the pricing page.

Security

Grade A, and why

cg scanned grade A with 0 findings against 26 rules in 11 categories — prompt injection, anti-refusal, data exfiltration, privilege escalation, supply chain, agent snooping, system-prompt leakage, SSRF and excessive agency — measured 7d ago.

A static scan of the body, not an audit. Every finding is printed with the line that produced it so you can judge whether it matters here. A mod is markdown that instructs an agent; that is exactly why what it instructs is worth reading.

Nothing flagged

None of the 26 patterns this scan looks for appear in this file: no shell pipes, no recursive deletes, no credential paths, no hidden text, no instruction-override or anti-refusal phrasing, no agent-config snooping. That is not a guarantee, it is the absence of the things that are checkable.

plugins/design-thinking/commands/cg.md · 50 lines

What it actually says

Extract (if target is existing code) or sketch (if target is a task) the call graph for: $ARGUMENTS

Apply the Design Graph method — nodes are functions, edges are data flow.

Graph Protocol — quick reference

Emit ALL sections below, in this order, with these markers:

PROBLEM: <one line>

X → DesignGraph<A, E, R>
│              │   │  │  │
│              │   │  │  └─ R: what each node needs      (§5)
│              │   │  └──── E: where the graph breaks    (§4)
│              │   └─────── A: what flows through nodes  (§2)
│              │
│              └─ nodes = functions, edges = data flow
│
└─ the problem

SHAPES:  records · IDs · state variants · named errors
GRAPH:   ascii call graph, annotated inline:
         R: deps · E: err ⟳retry[×n] → ↯escape(alt) | ☠die · 🔒 unknown→trusted
CARDINALITY: node (1) one-shot · (N) many over time · (T) time-bounded
BOUNDARIES:  every untrusted→trusted crossing (parse, don't validate)
BEHAVIOR:    orthogonal layers (retry, cache, logging) that wrap without changing the graph
SCOPE:       resources: acquire@x → release@x (structural, not convention)
TEST LAYERS: the R tests provide — same GRAPH, zero code change
VERDICT:     code matches graph? happy path free of error handling? E fully enumerated?

Rules

  • The graph is the ground truth. For existing code, reconstruct the graph the code ACTUALLY implements — not what the author intended.
  • Every node gets cardinality + R:. Every failure gets , , or . Every trust crossing gets 🔒.
  • Adapt vocabulary to the target language/stack (exceptions vs Result types, RAII vs context managers, etc.) — never the discipline.
  • If you find nodes that violate the method (tangled happy path, unscoped resources, hidden dependencies), list them under VERDICT, grouped by § number.

If the full spec is needed, use the graph-protocol skill (notation) and the design-method skill (the method) shipped in this plugin.

Changes

What this file has done since we first saw it

Hashed on every crawl. A supply-chain change to an agent config is a question of when, not whether, so the history is kept rather than the latest state alone.

  1. 7d ago First seen · 50 lines · 13 tokens per session scan A a2481df54293

Subscribe to this mod's changes

cg is a command published in the GitHub repository widnyana/eyay-toolkits (7 stars, last pushed 4d ago), licensed MIT. It adds 13 tokens to every session and 553 once invoked, about $0.0001 per session on Opus 5. A static security scan graded it A with 0 findings. No closer match exists in the catalogue, so it is treated as the original; first seen 2026-08-31.