Expand description
Guided-tour generation — deterministic graph traversal that picks the “important” symbols of a repo (or of a seeded subgraph) and orders them so a reader can walk through the codebase top-down.
Algorithm (pure graph, no LLM):
- Build adjacency from
Contains+Callsedges. - Score each node by in-degree across
Calls(centrality). - Pick top-K nodes globally, or BFS from a seed when one is provided.
- Return ordered tour steps with rationale per step.
Structs§
- Component
- A component (directory/module) in the architecture summary.
- Tour
- Tour
Step - One step in a generated tour.
Functions§
- generate
- Generate a tour for
branch. IfseedisSome, the tour is rooted at that symbol and walks outward viaCallsandContainsedges. IfNone, the tour picks the highest-centrality public entry points across the repo. - render_
markdown - Render a tour as a human-readable markdown plan.