# Adelaidasofia Graph Query MCP server

Source: https://glimind.com/server/mcp-registry%2Fio.github.adelaidasofia%2Fgraph-query-mcp
Registry id: `mcp-registry/io.github.adelaidasofia/graph-query-mcp`
Status: unknown

## Tools (7)

- `find_path`: Shortest path between two concepts. Auto-fuzzy-matches both ends.
- `get_community_members`: All nodes in the same community-detection cluster.
- `get_neighbors`: Connected nodes within N hops, sorted by degree.
- `get_node_info`: Full metadata + top neighbors for one node.
- `get_top_nodes`: Highest-degree nodes (the 'god nodes').
- `query_subgraph`: Subgraph around a list of concepts; reports node + edge counts.
- `search_nodes`: Fuzzy match against node names. Returns node IDs ranked by exact / starts-with / contains.

Measured by Glimind (https://glimind.com): MCP handshake + tool list only, no tool is ever called. CC BY 4.0.