Results for “dependency graph”

Codebase'i knowledge graph olarak analiz et. Dependency, call graph, hotspot analizi.

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

Use this skill when the user wants to turn code graph analysis into tracked GitHub issues — "audit the architecture", "find god nodes", "triage architectural debt", "run graphify and log issues", "what's over-coupled in this codebase", "create issues from graphify findings", "check for structural problems", "scan for architectural smells", or any request that combines codebase topology analysis with issue tracking. This skill runs graphify to build a dependency graph, parses GRAPH_REPORT.md for god nodes and structural patterns, converts findings into GitHub issue payloads, and optionally pushes them to the repo. It bridges static analysis and project management in a single automated pass. Requires graphify and gh CLI.

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

Turn notes, prose, code, schemas, or tables into editable diagrams, including flowcharts, architecture diagrams, and schedules. Choose Mermaid, Graphviz DOT, PlantUML, or SVG to suit the content, with image or PDF rendering when needed.

• Turn business procedures into flowcharts
• Diagram system architecture and dependencies
• Visualize database relationships and interactions

Choose automatic layouts for diagrams made of connected nodes. Match algorithms and tools to the graph structure, then plan connector routes, overlap handling, and stable placement so readers can follow relationships and edits remain predictable.

• Reducing crossings in a dependency graph
• Routing ERD connectors around tables
• Choosing layouts for trees and networks

Read and refresh wp-rocket's pre-built dependency graph at .claude/graph/dependency-graph.json. Use to locate a class file, trace dependencies, find the ServiceProvider that wires a service, or enumerate Subscribers in a module — without re-scanning the codebase from scratch. This skill is primarily a reader: the graph is built (and incrementally refreshed) by `node bin/build-knowledge-graph.js`. Invoke this skill at session start (to refresh if stale) and before grep/glob searches for class relationships.

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

Rebuild the vault dependency graph (_graph.md) via the deterministic generator script. $graph forces a full rebuild; $graph last (run after every $sync) rebuilds only if the vault changed; $graph [N] is treated as last. The generator reads the vault and writes _graph.md directly, so the file never streams through a model response.

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

Rebuild the vault dependency graph (_graph.md) via the deterministic generator script. /graph forces a full rebuild; /graph last (run after every /sync) rebuilds only if the vault changed; /graph [N] is treated as last. The generator reads the vault and writes _graph.md directly, so the file never streams through a model response.

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

Design, build, evaluate, or teach graph-based systems. Use for knowledge graphs, ontology/schema design, entity/relation/event extraction, entity resolution and fusion, GraphRAG or graph memory, and agent/task dependency graphs with concurrency, joins, failure handling, verification, or human gates.

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

Deterministic Software Graph analysis via Ontoly CLI and MCP. Use when: (1) Codebase architecture, dependency, route, service, module, configuration, or impact questions need graph evidence, (2) A repository should be analyzed before source search, (3) You need a persistent SoftwareGraph.json for validation, MCP, or agent workflows. Triggers: "build software graph", "trace route", "impact analysis", "architecture summary", "dependency graph", "what uses this", "Ontoly".

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

Review a repository’s architecture using Ontoly Software Graph, a map of code relationships. Explain module boundaries, package structure, dependencies, and architectural risks, with graph evidence and a stated confidence level.

• Understanding a repository’s overall architecture
• Reviewing module boundaries and package structure
• Investigating dependency cycles and architectural risks

Create Mermaid diagrams from code relationships parsed by Trailmark. Visualize function calls, class inheritance, module dependencies, class members, complexity hotspots, and paths from inputs to sensitive functions, with adjustable focus, depth, and layout.

• Mapping function calls around a selected function
• Visualizing class inheritance and members
• Drawing module dependency maps

Understand software architecture, trace request flows, and assess the impact of code changes using Ontoly’s graph of software relationships. Answers include supporting graph evidence, confidence, and relevant limitations.

• Explain a repository’s architecture
• Trace requests through routes and services
• Assess dependencies before refactoring

generate, refine, validate, and render diagrams from natural language, notes, code snippets, schemas, tables, or existing diagram source. use for flowcharts, swimlanes, sequence diagrams, state diagrams, er diagrams, class diagrams, architecture/c4-style diagrams, dependency graphs, gantt charts, mind maps, user journeys, sankey-style flows, org charts, network graphs, and other visual models. supports mermaid by default, graphviz dot for complex graph layout, plantuml for uml-heavy engineering diagrams, and svg output when direct markup is more reliable.

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

generate, refine, validate, and render diagrams from natural language, notes, code snippets, schemas, tables, or existing diagram source. use for flowcharts, swimlanes, sequence diagrams, state diagrams, er diagrams, class diagrams, architecture/c4-style diagrams, dependency graphs, gantt charts, mind maps, user journeys, sankey-style flows, org charts, network graphs, and other visual models. supports mermaid by default, graphviz dot for complex graph layout, plantuml for uml-heavy engineering diagrams, and svg output when direct markup is more reliable.

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

Apply practical DAG decomposition, transitive-edge reduction, and reachability indexing to dense dependency graphs. Use when low width and repeated queries justify preprocessing. NOT for cyclic graphs, one-off graph checks, or exact-minimum-chain requirements.

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

Derive an execution roadmap from a project's vision/spec docs by first principles, then diff that fresh derivation against the existing roadmap to prove the task ORDER is correct. Use this whenever the user wants to review, validate, re-derive, or sanity-check an execution roadmap or delivery plan; asks whether the tasks/epics are "in the right order"; suspects a task is scheduled before its prerequisite (a producer-after-consumer / dependency-inversion error like "OpenAPI after the web client that consumes it", OR a cross-cutting inherited default like observability/auth/tenancy scheduled after the feature work that inherits it — a seam-after-consumer error); wants to find missing tasks, circular dependencies, or over-fragmented epics; or wants to compact a plan to raise velocity. Also trigger on "review the roadmap", "re-derive the plan from the spec", "is this the right build order", "check the dependency graph of our epics", "which task should come first". It reads the vision + spec corpus, decomposes actors → use-cases → modules → epics → typed tasks, identifies cross-cutting inherited-default seams, builds a real dependency graph with hard + soft (seam) edges (deterministic helper), breaks cycles, topologically orders, compacts, and emits a derived roadmap PLUS a delta report against the current one — it never blindly overwrites a hand-crafted roadmap.

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

Use when you need blast-radius analysis, dependency graphs, cross-repo impact, breaking-change diff, or architectural overview of .NET workspaces. Keywords: blast radius, dependency graph, impact analysis, cross-repo, call graph, endpoint map, EF Core lineage, breaking change, daemon, reindex.

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

Guide for optimizing MSBuild build parallelism and multi-project scheduling. Only activate in MSBuild/.NET build context. USE FOR: builds not utilizing all CPU cores, speeding up multi-project solutions, evaluating graph build mode (/graph), build time not improving with -m flag, understanding project dependency topology. Note: /maxcpucount default is 1 (sequential) — always use -m for parallel builds. Covers /maxcpucount, graph build for better scheduling and isolation, BuildInParallel on MSBuild task, reducing unnecessary ProjectReferences, solution filters (.slnf) for building subsets. DO NOT USE FOR: single-project builds, incremental build issues (use incremental-build), compilation slowness within a project (use build-perf-diagnostics), non-MSBuild build systems. INVOKES: binlog MCP server tools (expensive_projects, expensive_targets, project_target_times); falls back to dotnet build -m, dotnet build /graph, binlog replay + grep.

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

Apply practical DAG decomposition, transitive-edge reduction, and reachability indexing to dense dependency graphs. Use when low width and repeated queries justify preprocessing. NOT for cyclic graphs, one-off graph checks, or exact-minimum-chain requirements.

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

Apply practical DAG decomposition, transitive-edge reduction, and reachability indexing to dense dependency graphs. Use when low width and repeated queries justify preprocessing. NOT for cyclic graphs, one-off graph checks, or exact-minimum-chain requirements.

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

Explore a knowledge graph, a network of entities and relationships, from a chosen starting point. Rank relevant paths and summarize dependencies or indirect connections to help understand code structure and assess the impact of changes.

• Assessing the impact of changing a component
• Tracing dependency chains
• Discovering indirect connections between entities

Build a searchable index and relationship graph from ADRs, records of architectural decisions. Import two supported document formats, refresh existing metadata without duplicate relationships, and review summaries of statuses, missing references, and inconsistencies.

• Index ADRs imported from another project
• Refresh a graph that differs from files on disk
• Set up ADR tracking in an existing codebase

Create diagrams that explain systems, workflows, and data relationships using a consistent brand style. The skill guides diagram selection, layout, and readability, with HTML, SVG, and PNG output and support for importing existing diagram formats.

• Explain system architecture
• Visualize workflows and team handoffs
• Restyle existing diagrams to match a brand

Analyze a software bill of materials, an inventory of software components, against known vulnerability records. Trace indirect dependencies, assess risk, and produce reports that help teams prioritize fixes and review supplier software.

• Assessing vulnerabilities in vendor-provided software inventories
• Checking whether a newly disclosed CVE affects deployed software
• Adding SBOM vulnerability checks to CI/CD