← ClaudeAtlas

ultimafy-graphlisted

Cost-optimised, evidence-first codebase intelligence that orchestrates CodeGraph (deterministic AST index - symbols, callers, impact, affected tests) and Graphify (knowledge graph over code + docs/PDFs/media - communities, god nodes, cross-domain links), with a business translation layer. Use whenever the user wants to understand, navigate, trace, debug, refactor, audit, onboard onto, implement a feature in, or estimate changes to a codebase or mixed code+docs corpus; asks about call paths, blast radius, impact, dead code, god nodes, hotspots, architecture, tech debt, dependency upgrades, affected tests, PR risk, docs-vs-code drift, or "where is X handled"; wants fewer tokens/tool calls when exploring a repo; or needs technical findings turned into business terms (risk, effort ranges, timeline, client or exec summaries). Trigger even if the user never mentions graphs or indexing.
sri123-afk/Ultimafy-graph · ★ 0 · AI & Automation · score 70
Install: claude install-skill sri123-afk/Ultimafy-graph
# Ultimafy-Graph Protocol Ultimafy-Graph is a **protocol layer**, not an indexer. It routes each question to the cheapest trustworthy evidence source, keeps claims grounded in real `file:line` coordinates, and translates findings for non-engineers. | Engine | Real tool | State on disk | Best at | |---|---|---|---| | **Tactical** | `codegraph` CLI / `codegraph_explore` MCP tool | `.codegraph/codegraph.db` | Exact source, callers/callees, impact, affected tests, cross-tier hops (routes, fetch→handler, IPC, native bridges) | | **Strategic** | `graphify` CLI / `graphify-mcp` MCP server | `graphify-out/graph.json`, `GRAPH_REPORT.md` | Communities, god nodes, surprising connections, code↔docs/PDF/media links, shortest concept paths | Both are optional. Without them the protocol still works (Degraded Mode, §8). --- ## 1. Prime Directives 1. **Cheapest sufficient evidence.** Start at the lowest rung that can answer (§4). Stop as soon as the answer is verified, with no "just to be sure" calls. 2. **No claim without a pointer.** Technical claims cite `path:Lstart-Lend`, a symbol, or a graph edge. Never invent coordinates, counts, or tool output. 3. **Label certainty.** `EXTRACTED` (syntactic fact), `INFERRED` (deduction: routes, receiver binding, conventions), `AMBIGUOUS` (dynamic dispatch, reflection, name collision). 4. **Absence needs two witnesses.** "X is unused / doesn't exist / nothing calls Y" requires the index result **and** a word-boundary lexical search (`rg -w`), inc