Skip to content
cccskills
FreePublished on GitHub

dependency-graph

Generates a Mermaid dependency graph showing import relationships between modules. Use when analyzing coupling, finding circular deps, or planning refactors.

The English summary is being prepared. Showing the original description.

See how to install

Files included (1)

  • SKILL.md3.3 KB

SKILL.md (original)

Review the instructions the agent will receive before you install.

Dependency Graph

Generate a Mermaid flowchart showing import and dependency relationships between modules, packages, or plugins.

When To Use

  • Understanding what depends on what
  • Finding circular dependencies
  • Analyzing coupling between modules
  • Planning refactoring by seeing dependency impact
  • Answering "what breaks if I change this?"

When NOT To Use

  • Runtime call paths (use cartograph:call-chain)
  • Type hierarchies (use cartograph:class-diagram)

Workflow

Step 1: Explore the Codebase

Dispatch the codebase explorer agent:

Agent(cartograph:codebase-explorer)
Prompt: Explore [scope] and return a structural model.
Focus on import statements and cross-module dependencies
for a dependency graph. Track both internal and external
imports.

Step 2: Generate Mermaid Syntax

Transform the structural model into a Mermaid flowchart with directed edges representing dependencies.

Rules for dependency graphs:

  • Use flowchart LR (left-right) for dependency direction
  • Each node is a module or package
  • Edges point from dependent to dependency (A --> B means "A depends on B")
  • Color-code by dependency type:
    • Default arrows for internal dependencies
    • Dotted arrows (-.->) for external/optional deps
    • Thick arrows (==>) for critical path dependencies
  • Group into subgraphs by package/plugin
  • If depth parameter given, limit transitive dependencies
  • Highlight circular dependencies with red styling

Example output:

flowchart LR
    subgraph sanctum[Sanctum]
        commit[commit]
        pr_prep[pr_prep]
        workspace[workspace]
    end

    subgraph leyline[Leyline]
        git[git_platform]
        errors[error_patterns]
    end

    subgraph external[External]
        subprocess[subprocess]
        json[json]
    end

    commit --> git
    commit --> json
    pr_prep --> workspace
    pr_prep --> git
    workspace --> errors
    workspace -.-> subprocess

Step 3: Render via MCP

Call the Mermaid Chart MCP to render:

mcp__claude_ai_Mermaid_Chart__validate_and_render_mermaid_diagram
  prompt: "Dependency graph of [scope]"
  mermaidCode: [generated syntax]
  diagramType: "flowchart"
  clientName: "claude-code"

If rendering fails, fix syntax and retry (max 2 retries).

Step 4: Present Results

Show the rendered diagram with analysis notes:

  • Total modules and dependency count
  • Most-depended-on modules (high fan-in)
  • Modules with most dependencies (high fan-out)
  • Circular dependencies if any detected

Exit Criteria

  • Mermaid flowchart LR syntax generated with directed edges from dependent to dependency (A --> B means "A depends on B")
  • mcp__claude_ai_Mermaid_Chart__validate_and_render_mermaid_diagram called and returns without error
  • Analysis notes include total module count, highest fan-in modules, and highest fan-out modules
  • Circular dependencies, if detected, are highlighted with red styling and listed explicitly in the analysis notes
  • External dependencies use dotted arrows (-.->) distinct from internal dependency arrows

Reviews

No reviews yet. Tell others what you thought.

Comments

No login needed. Share how it worked for you, ask a question, or note where it did not run.

No comments yet. Be the first to write one.

Comments are published right away. Do not include personal information such as email addresses or phone numbers. Up to 2 URLs.

0 / 1,000 characters

This form is protected by reCAPTCHA, and the Google Privacy Policy and Terms of Service apply.

More skills from this repository

Shapes turns action-first: action leads, steps numbered, state restated. Use for ADHD-friendly output. Do not use to trim tokens; use response-compression.

The English summary is being prepared. Showing the original description.

athola/claude-night-market342Updated Oct 17, 2026

Inverts burden of proof for code additions. Use when reviewing PRs, planning refactors, or running unbloat to challenge every addition's necessity.

The English summary is being prepared. Showing the original description.

athola/claude-night-market342Updated Oct 17, 2026

Tracks per-agent token usage and flags waste in parallel dispatch. Use when evaluating parallel agent efficiency or after a multi-agent run.

The English summary is being prepared. Showing the original description.

athola/claude-night-market342Updated Oct 17, 2026

Coordinates Claude agent teams via filesystem protocol. Use when orchestrating parallel agents with task dependencies. Do not use for single-agent tasks.

The English summary is being prepared. Showing the original description.

athola/claude-night-market342Updated Oct 17, 2026

Evaluates API surface design, consistency, and exemplar alignment. Use when reviewing public API changes or before releasing a new API surface.

The English summary is being prepared. Showing the original description.

athola/claude-night-market342Updated Oct 17, 2026

Selects architecture paradigm via research before scaffolding. Use when architecture is undecided and the choice needs justification and documentation.

The English summary is being prepared. Showing the original description.

athola/claude-night-market342Updated Oct 17, 2026

See all skills by athola

Report a problem with this skill