graphify

Convert unstructured code, docs, and media into queryable knowledge graphs.

1|Updated Apr 24, 2026
One-click install
npx skills add https://github.com/automatedigital/spark --skill graphify-automatedigital
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: graphify
Source: https://github.com/automatedigital/spark/tree/main/.claude/skills/graphify
Command: npx skills add https://github.com/automatedigital/spark --skill graphify-automatedigital

SYSTEM DOCUMENTATION & REQUIREMENTS

💡 This Skill includes references (resource) components.

What problem does it solve?

This Skill eliminates the tedious manual work of tracing relationships, dependencies, and architectural patterns across large codebases, scattered documentation, research papers, and multimedia content, turning unstructured project assets into an organized, queryable knowledge graph with community detection to surface hidden cross-document connections.

Core Features & Use Cases

  • Multi-format knowledge graph building: Converts any folder of code, docs, papers, images, or video into a persistent knowledge graph with god node detection, community clustering, and an honest audit trail for all extracted relationships.
  • Flexible querying and analysis: Supports natural language questions, shortest path tracing between concepts, and plain-language explanations of individual nodes, with results saved back to the graph to improve future queries.
  • Multiple export options: Generates interactive HTML visualizations, GraphRAG-ready JSON, plain-language audit reports, optional Obsidian vaults, Neo4j cypher scripts, and wiki formats, with support for incremental updates to avoid re-extracting unchanged content.
  • Use Case: For example, when onboarding to a new large codebase, use this Skill to automatically map out module dependencies, key functions, and architectural patterns without manually reading through hundreds of files.

Quick Start

Use the graphify skill to build a queryable knowledge graph of your current project directory and receive a plain-language report of its architecture, key components, and cross-file relationships.

Frequently Asked Questions about graphify

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

FAQPage Schema
How do I turn a large codebase into a queryable knowledge graph?

You can build a queryable knowledge graph from a large codebase by processing unstructured code files to extract dependencies, map architectural patterns, and perform community detection, resulting in a persistent graph with full audit trails for natural language querying.

What is the best way to map architectural dependencies across scattered documentation?

The best way to map architectural dependencies across scattered documentation is converting docs, papers, and multimedia into a unified knowledge graph that surfaces hidden cross-document connections and traces shortest paths between concepts.

Can I extract knowledge graphs from images and video alongside code?

Yes, you can extract knowledge graphs from images and video alongside code. The Skill utilizes optional LLM subagents for semantic extraction on non-code assets, integrating them into the same persistent graph structure as the codebase analysis.

Does this codebase analysis tool export to Neo4j and Obsidian?

Yes, this codebase analysis tool exports to Neo4j and Obsidian. It generates Neo4j cypher scripts, optional Obsidian vaults, interactive HTML visualizations, and GraphRAG-ready JSON from the extracted knowledge graph.

How do I avoid re-extracting unchanged files when updating a knowledge graph?

To avoid re-extracting unchanged files when updating a knowledge graph, the Skill supports incremental updates. It processes only new or modified content while preserving existing node relationships and the audit trail.

What are the limitations of using community detection for codebase analysis?

A limitation of using community detection for codebase analysis is that clustering groups nodes by structural connections, which may obscure specific functional dependencies unless you explicitly trace the shortest path between individual concepts.