A
licenseNot graded
qualityA
maintenanceEnables querying a Neo4j knowledge graph built from Git repositories and relational database schemas via MCP, with tools for schema inspection, Cypher queries, and searching code and database entities.
MIT
litcoin-mcp
by hyi
Related Servers
Alternatives to litcoin-mcp
No user-submitted related servers found.
Related Servers
- AlicenseAqualityBmaintenanceRuns a local, read-only knowledge graph over MCP, enabling graph queries, path finding, explanations, neighbor exploration, statistics, and god-node discovery without cloud dependencies.10Apache 2.0
- AlicenseAqualityBmaintenancePersistent knowledge graph MCP server with SQLite backend. Enables graph traversal, fuzzy search, temporal queries, and timestamps for entity management.12MIT
- AlicenseAqualityCmaintenanceEnables MCP-capable agents to query a LightRAG knowledge graph for grounded answers with source files, ingest documents into the index, and retrieve indexing statistics.3MIT
- AlicenseAqualityCmaintenanceEnables semantic search, code exemplar lookup, knowledge-graph statistics, and cached retrieval over locally ingested notebook and Markdown content through MCP.4Apache 2.0
- AlicenseBqualityBmaintenanceEnables building and querying vector-based knowledge graphs with node and edge management and semantic search.510 npmMIT
TDQS
C2/5.0
Scored across 5 tools
Disambiguation4/5
Tool names use distinct noun phrases (node, node_edges, edges_between, semantic_similar_edges, semantic_similar_nodes) that indicate different query targets. However, the absence of descriptions could cause confusion between get_node_edges and get_edges_between for an agent unfamiliar with the API.
Naming Consistency5/5
All tools follow a consistent get_<noun> pattern with snake_case, making the naming predictable and uniform.
Tool Count5/5
The server provides exactly 5 tools, which is a well-scoped number for a graph query server, not overwhelming or too sparse.
Completeness3/5
The surface covers node retrieval, edge retrieval, and semantic similarity queries, but lacks basic operations like listing all nodes/edges or fetching an edge by ID, leaving notable gaps for broader graph exploration.
Maintenance
ActivityInactive
ResponsivenessNo issues