بنقرة واحدة
debug-issue
Systematically debug issues using graph-powered code navigation
التثبيت باستخدام Codex أو Claude انسخ هذا Prompt والصقه في Codex أو Claude أو مساعد آخر ليراجع صفحة Skill ويثبّتها لك.
القائمة
Systematically debug issues using graph-powered code navigation
التثبيت باستخدام Codex أو Claude انسخ هذا Prompt والصقه في Codex أو Claude أو مساعد آخر ليراجع صفحة Skill ويثبّتها لك.
استنادا إلى تصنيف SOC المهني
Register repositories, maintain multi-repo graph freshness, and search across repos with dagayn.
Read a Markdown document with full dependency context — query the dagayn graph first, pre-read referenced docs and code by edge type, then read the body.
Author Markdown documents (READMEs, design docs, RFCs) so dagayn extracts correct dependency edges. Four-stage flow — outline & sort, draft & verify, polish, summary.
Evaluate architecture signals through the unified dagayn dispatcher
Navigate and understand codebase structure using the knowledge graph
Plan and execute safe refactoring using dependency analysis
| name | debug-issue |
| description | Systematically debug issues using graph-powered code navigation |
Use the knowledge graph to systematically trace and debug issues.
This packaged skill is mode-neutral. dagayn install rewrites this section with
the selected embedding mode so bug searches balance semantic recall with speed.
get_minimal_context_tool(task="<bug or symptom>") to check graph freshness,
risk, and suggested next tools.semantic_search_nodes_tool to find code related to the issue.query_graph_tool with callers_of and callees_of to trace call chains.traverse_graph_tool only after selecting a concrete suspected node and
only when a bounded neighborhood is more useful than a specific caller,
callee, import, test, or documentation relationship.flow_tool(mode="list", detail_level="minimal") or
review_tool(mode="affected_flows") to identify candidate flow names before
calling flow_tool(mode="get").query_graph_tool(pattern="docs_for", target="<path::symbol>", detail_level="minimal")
to pull in linked specs, runbooks, explanations, and issue notes. If the bug
report starts from a Markdown contract section, use
query_graph_tool(pattern="implementations_of", target="<doc.md>::<section-slug>", detail_level="minimal")
to find the implementation nodes linked by implemented_by /
implements_contract.review_tool(mode="changes") to check if recent changes caused the issue. Read
analysis_summary for risk reasons, affected-flow rankings, hotspot
proximity, and recommended tests.review_tool(mode="impact") on suspected files only when analysis_summary or
the call trace leaves the blast radius unclear.rg
once to map that literal string to a graph node, then return to graph tools.dagayn: documentation directives as typed traceability evidence. Code
comments such as # dagayn: explained-by docs/runbook.md#Failure Mode can
point to runbooks or problem statements that are more useful than another
caller hop.evidence_type: authored
contract links are stronger than extracted explanatory links, while
heuristic_reachable links require source confirmation.query_graph_tool returns no result or status="not_found", read
zero_result_reason, next_action, answerability, and missingness
before ruling out a path.Use MCP tools first. If the current MCP server profile does not expose a tool
such as flow_tool or review_tool, run the same implementation
through the CLI without restarting the agent:
dagayn tool get_minimal_context_tool --arg 'task="debug login timeout"'
dagayn tool flow_tool --arg mode='"list"' --arg detail_level='"minimal"'
dagayn tool flow_tool --arg mode='"get"' --arg 'flow_name="handle_request"'
dagayn tool review_tool --arg mode='"impact"' --arg 'changed_files=["src/auth.py"]'
dagayn tool query_graph_tool --arg pattern='"docs_for"' --arg target='"src/auth.py::handler"'
dagayn tool query_graph_tool --arg pattern='"implementations_of"' --arg target='"docs/auth.md::login-contract"'
get_minimal_context_tool(task="<your task>") before any other graph tool.detail_level="minimal" on all calls. Only escalate to "standard" when minimal is insufficient.