neumann-graph

Model and query directed property graph data with Neumann's graph engine.

74|6|Updated Dec 23, 2025
One-click install
npx skills add https://github.com/Shadylukin/Neumann --skill neumann-graph
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: neumann-graph
Source: https://github.com/Shadylukin/Neumann/tree/main/.claude/skills/neumann-graph
Command: npx skills add https://github.com/Shadylukin/Neumann --skill neumann-graph

SYSTEM DOCUMENTATION & REQUIREMENTS

What problem does it solve?

Enable developers and analysts to store, model, and query directed property graph data alongside tables and vectors in a single Neumann instance, removing the need to synchronize separate graph and vector systems.

Core Features & Use Cases

  • Graph modeling and CRUD: Create, read, update, and delete nodes and edges with labels, properties, and auto-generated IDs.
  • Traversal and pathfinding: Neighbor queries, shortest and weighted paths, variable-length paths, and cross-engine neighbor ranking by vector similarity.
  • Algorithms & analytics: Run PageRank, Betweenness, Closeness, Eigenvector, Louvain, and Label Propagation for graph insights; supports constraints, indexes, aggregation, and pattern matching.
  • Cypher support and batching: Use a Cypher subset for complex queries and perform batch create/update/delete operations for scale.
  • Use case example: Build a knowledge graph with entities and embeddings to power RAG, agent memory, or permissioned graph queries that respect relationships and semantic similarity.

Quick Start

Create a person node named Alice with role engineer and then run a NEIGHBORS query to find her outgoing connections.

Frequently Asked Questions about neumann-graph

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

FAQPage Schema
How do I model and query directed property graph data alongside existing tables?

You can model and query directed property graph data by creating nodes and edges with labels and properties, then using traversal commands and graph algorithms within a single database instance to avoid synchronizing separate systems.

Can I run Cypher queries to traverse graph relationships and find paths?

Yes, you can run a Cypher subset for complex queries to traverse relationships, find shortest or weighted paths, and execute variable-length path traversals across directed graph edges.

What graph algorithms are available for analytics on my graph data?

Available graph algorithms include PageRank, Betweenness, Closeness, Eigenvector, Louvain, and Label Propagation, enabling you to compute centrality, detect communities, and extract structural insights.

Does this graph engine support batch operations and indexing for large-scale data?

Yes, it supports batch create, update, and delete operations for scale, alongside indexing and constraints to maintain data integrity during bulk graph modifications.

How do I find neighboring nodes and rank them by vector similarity?

You can execute NEIGHBORS queries with OUTGOING, INCOMING, or BOTH direction keywords, and apply cross-engine neighbor ranking by vector similarity to retrieve related graph entities.

What is the best way to build a knowledge graph for RAG and agent memory?

Build a knowledge graph by creating entity nodes with embeddings and relationship edges, then query traversals and vector similarity to power retrieval-augmented generation and agent memory context.