Traverse symbol relationships across calls, imports, extends, and implements.
npx skills add https://github.com/aimasteracc/mycelium --skill reachability-aimasteracc
Please help me install this Agent Skill. Skill: reachability Source: https://github.com/aimasteracc/mycelium/tree/main/skills/reachability Command: npx skills add https://github.com/aimasteracc/mycelium --skill reachability-aimasteracc
Understanding complex symbol relationships in large code graphs can be challenging when connections span multiple edge kinds. This Skill provides fast, multi-hop navigation to reason about reachability, dependencies, and cross-references across calls, imports, extends, and implements.
Ask for the shortest path from one symbol to another across edge kinds to reveal the full chain.
High-intent search queries and answers about installing and using this skill.
To find the shortest path between two symbols in a codebase, you can use multi-hop graph navigation to return the exact chain across calls, imports, extends, and implements. This reveals the full dependency chain connecting the target symbols.
Forward and backward reachability analysis computes all symbols reachable from a starting point or that reach a target. It traces dependencies across multiple edge kinds like calls and imports to map the full impact of a symbol.
You can explore k-hop neighborhoods around a symbol to map surrounding context at fixed hop distances. This identifies immediate and secondary dependencies, allowing you to gauge the blast radius of refactoring or debugging changes.
Yes, you can enumerate all incoming and outgoing cross-references for a code symbol across multiple edge kinds. This inspect a symbol's immediate neighborhood to reveal every dependency connection radiating outward and inward.
Multi-hop symbol graph navigation supports both debugging and refactoring by answering what connects X to Y and what is reachable from a symbol. It handles complex code graphs where connections span multiple edge kinds.
You can assess a symbol's dependency depth to a leaf to gauge complexity using graph traversal. This measures the distance from a starting symbol to its terminal dependencies, indicating how deeply nested its underlying logic is.
Likas07Orchestrate LSP clients into a unified semantic graph of code symbols.
dojoengineGenerates ASCII call graphs showing caller–calle relationships for Rust functions via LSP call hierarchy endpoints.
endorlabsFetch and search decoded call graph artifacts for symbol reachability.
barkleesandersSearch codebases for text patterns and syntax-aware structural code patterns.
