hce-explore

To explore a codebase quickly, you can use deterministic AST parsing and hypergraph indexing to map structural relationships. This approach builds a graph of symbols and call graphs without invoking LLMs, enabling millisecond queries.

Yes, you can query the call graph and architecture of any software repository. The system indexes the codebase to reveal structural relationships, allowing you to perform fast searches and lookups for specific symbols.

Static analysis for code exploration works without LLMs by using deterministic AST parsing. This token-efficient method builds a hypergraph index of the codebase, allowing you to retrieve overviews and natural-language answers independently.

The best way to visualize codebase architecture is by generating interactive D3 graphs and memory tours. These visualizations are created from the hypergraph index, providing a reusable exploration tour for human review.

To index a codebase and reveal structural relationships, prompt the assistant to explore the repository. It will automatically apply AST parsing, load the hypergraph, and provide an overview of the most central symbols.

Limitations of hypergraph indexing include its reliance on deterministic AST parsing, meaning it focuses on structural relationships rather than semantic understanding. It is designed for fast architectural queries, not dynamic runtime analysis.