mcp-graph-engine (utilitydelta/mcp-graph-engine) is an MCP server listed on the M8ven Trust Index. It scores 74 out of 100, grade C. It declares 24 tools. No publisher has claimed this listing.
A graph database MCP server that lets AI assistants build, analyze, and visualize relationship graphs with algorithms like PageRank and cycle detection.
Warning. Serious findings were identified. Review the full report before connecting. Grades reflect the full trust pyramid: code, verification depth, and reputation. New projects cap at C until adoption is earned.
How we verified
Verified is a snapshot. Live keeps it current, and builds your track record.
⚡ Connect GitHub → continuous verification on every pushwhy connect →Who stands behind it
utilitydelta
Source: Glama
Claim it to get a verified publisher badge, a free copy of our full audit findings, and direct contact for any high-priority issues we find. Or connect your repo for our deepest verification, Live Monitored: read-only, revoke anytime. What we access →
Install from
The grade above is for the source repository. Registries can serve a different version, so we mark the ones we were not able to read.
These names and descriptions are the publisher's own, read from the source code. We print them as written. Our assessment is the findings above, not this list.
add_factsAdd facts (relationships) to the graph. Nodes are auto-created if they don't exist.
add_knowledgeAdd knowledge using text DSL. Format: 'Subject relation Object' per line. Quote spaces: '\"Auth Service\" \"depends on\" \"User DB\"'. Type hints: 'Node:type rel Target:type'. Lines with # are comments.
list_graphsList all graph sessions with statistics
delete_graphDelete a graph session
get_graph_infoGet graph statistics and info
forgetRemove a node and its connected edges
forget_relationshipRemove an edge from the graph
shortest_pathFind shortest path between two nodes (Dijkstra). Fuzzy matches node labels.
all_pathsFind all simple paths between two nodes. Fuzzy matches labels.
pagerankCalculate PageRank scores for node importance
connected_componentsFind weakly connected components (node groups connected by paths)
find_cyclesDetect cycles (circular dependencies) in the graph
transitive_reductionRemove redundant transitive edges (if A->B->C and A->C exist, remove A->C)
degree_centralityCalculate in/out degree centrality to find highly connected nodes
subgraphExtract subgraph with specified nodes and their interconnections. Fuzzy matches labels.
ask_graphPattern-matching queries: 'what depends on X', 'what does X depend on', 'path from X to Y', 'all paths from X to Y', 'cycles', 'most connected', 'orphans', 'components'. Use cypher_query for complex queries.
dump_contextGet complete graph summary: nodes by type, relationships, and insights (hubs, cycles, orphans).
import_graphImport graph from DOT, CSV, GraphML, or JSON. Merges into existing graph.
export_graphExport graph to DOT, CSV, GraphML, JSON, or Mermaid format.
create_from_mermaidCreate graph from Mermaid flowchart. Edge labels become relation types.
cypher_queryExecute Cypher query. Use DOUBLE QUOTES for strings. Edge types via WHERE r.relation = "type". Examples: MATCH (a)-[r]->(b) WHERE r.relation = "depends_on" RETURN a.label, b.label MATCH (n) WHERE n.type = "service" RETURN n.label MATCH (a)-[*1..3]->(b) RETURN DISTINCT b.label Node props: lab…
visualize_graphOpen browser visualization at localhost URL. Updates in real-time.
update_visualization_filterUpdate Cypher filter for visualization. Empty string clears filter.
stop_visualizationStop the visualization server.
VIS_ENABLEDEnable/disable visualizationVIS_PORTVisualization server portVIS_HOSTVisualization server hostTool annotations
No tools have read-only/destructive annotations
Add readOnlyHint or destructiveHint annotations to every tool so hosts can warn users before invoking.
All four hints declared on every tool
24/24 tools missing one or more hints — add_facts (missing: readOnlyHint, destructiveHint, idempotentHint, openWorldHint); add_knowledge (missing: readOnlyHint, destructiveHint, idempotentHint, openWorldHint); list_graphs (missing: readOnlyHint, destructiveHint, idempotentHint, openWorldHint), +21 more. OpenAI's directory rejects tools where any of the four hints are missing or non-boolean.
For every tool, set all four hints (readOnlyHint, destructiveHint, idempotentHint, openWorldHint) to explicit true/false values that match the handler’s actual behaviour.
Tool test coverage
18/24 tools referenced in tests (75%)
Write tests that reference each tool by name so every tool has at least one test.
No eval / new Function
1 eval() or new Function() call — dynamic code execution
Replace eval / Function with explicit parsing or safer alternatives.
Readable source code
1 file are minified or bundled, which is usually build output rather than concealment
Ship unminified, readable source.
Claim the listing to review these findings one by one and send us a correction where you disagree, straight to the team. Claiming also means we tell you when the grade moves, and reach you first if we find anything urgent.
[](https://m8ven.ai/mcp/utilitydelta/mcp-graph-engine)?variant=verified from the URL.Vetting this one by hand? Tool Check is an MCP that scores other MCPs. Add it once and ask Claude, ChatGPT, or any MCP client to grade a server, surface CVEs, check the publisher, and suggest safer alternatives — before you install.
https://m8ven.ai/api/mcp/tool-check