Builds a dependency graph for a codebase and returns a summary: file count, import edges, entry points, circular dependencies and the most complex modules. Use this instead of reading every file when you need architectural context.

Lists the modules nothing else imports — where execution starts. Useful for orienting in an unfamiliar codebase before reading any source.

Detects import cycles using Tarjan's algorithm. Returns each cycle with a severity based on how many modules it spans.

Ranks modules by cyclomatic complexity so you can find refactoring targets without reading the codebase.