cqs-gather

Seed semantic search results and expand them via call graph traversal.

13|3|Updated Jan 31, 2026
One-click install
npx skills add https://github.com/jamie8johnson/cqs --skill cqs-gather
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: cqs-gather
Source: https://github.com/jamie8johnson/cqs/tree/main/.claude/skills/cqs-gather
Command: npx skills add https://github.com/jamie8johnson/cqs --skill cqs-gather

SYSTEM DOCUMENTATION & REQUIREMENTS

What problem does it solve?

Seeds semantic search results and expands them through call graph traversal to reveal related code regions.

Core Features & Use Cases

  • Seed semantic search results for a query to identify relevant functions and modules.
  • Expand results via BFS along the call graph to map dependencies and call relationships.
  • Use Case: quickly understand how a feature is implemented by following related functions and their callers/callees.

Quick Start

Run the cqs_gather tool with a query to seed results and expand through the call graph.

Frequently Asked Questions about cqs-gather

High-intent search queries and answers about installing and using this skill.

FAQPage Schema
How do I expand semantic search results using call graph traversal?

To expand semantic search results using call graph traversal, seed an initial query and apply depth-bounded BFS to map related functions and dependencies. Directional expansion and configurable limits tailor the traversal to fit your specific analysis context.

What is the best way to trace function callers and callees after a semantic code search?

Tracing function callers and callees after a semantic code search is best handled by expanding seed results along the call graph. This maps dependencies and call relationships, helping you quickly understand how a specific feature is implemented.

Can I limit the depth of BFS expansion when analyzing a call graph?

Yes, you can limit the depth of BFS expansion when analyzing a call graph. The traversal supports configurable limits and directional expansion via argument parsing for --expand, --direction, and --limit to fit your analysis context.

How does call graph BFS help with software engineering analysis?

Call graph BFS helps with software engineering analysis by expanding seed search results to reveal related code regions. It maps dependencies and call relationships, allowing you to quickly understand feature implementation by following related functions.

Does semantic search work with directional call graph expansion?

Yes, semantic search works with directional call graph expansion. You can configure the expansion direction, depth, and limits using specific arguments to tailor the traversal when mapping dependencies and call relationships.

When should I use depth-bounded BFS for code analysis?

Depth-bounded BFS should be used for code analysis when you need to expand seed search results while controlling traversal scope. It maps dependencies and call relationships efficiently, fitting the analysis context with configurable limits.