gds-agents

neo4j-contrib/gds-agents

3.3

If you are the rightful owner of gds-agents and would like to certify it and/or have it hosted online, please leave a comment on the right or send an email to henry@mcphub.com.

This MCP Server leverages the Neo4j Graph Data Science (GDS) library to enable complex graph analysis and algorithm execution on Neo4j databases.

The Model Context Protocol (MCP) Server is designed to facilitate advanced graph analysis using the Neo4j Graph Data Science (GDS) library. It allows users to execute a wide range of graph algorithms on large, heterogeneous, and attributed graphs stored in a Neo4j database. The server is particularly useful for analyzing complex networks, such as transportation systems, social networks, and biological networks, where understanding the structure and dynamics of the graph is crucial. By integrating with the GDS library, the MCP Server provides access to a comprehensive suite of graph algorithms, including centrality measures, pathfinding, and community detection. This enables users to gain insights into the most important nodes, shortest paths, and critical connections within their graph data. The server is designed to be user-friendly, allowing users to ask natural language questions about their graph and receive detailed answers, including intermediate outputs and algorithm parameters.

Features

  • Integration with Neo4j GDS library for advanced graph analysis
  • Support for a wide range of graph algorithms, including centrality, pathfinding, and community detection
  • User-friendly interface for natural language queries
  • Detailed answers with intermediate outputs and algorithm parameters
  • Ability to analyze large, heterogeneous, and attributed graphs

Tools

  1. neo4j-gds:find_shortest_path

    Finds the shortest path between two nodes in the graph.

  2. neo4j-gds:degree_centrality

    Calculates the degree centrality for nodes in the graph.

  3. neo4j-gds:betweenness_centrality

    Calculates the betweenness centrality for nodes in the graph.

  4. neo4j-gds:closeness_centrality

    Calculates the closeness centrality for nodes in the graph.

  5. neo4j-gds:pagerank

    Calculates the PageRank for nodes in the graph.