Skip to content

Commit cb886a2

Browse files
authored
Add gds agent (#384)
1 parent 6457bee commit cb886a2

File tree

2 files changed

+23
-0
lines changed

2 files changed

+23
-0
lines changed
422 KB
Loading

modules/genai-ecosystem/pages/model-context-protocol-mcp.adoc

Lines changed: 23 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -234,6 +234,29 @@ Cypher Ingest
234234
image::https://dist.neo4j.com/wp-content/uploads/mcp-data-modeling-claude-data-discovery.png[width=400]
235235
image::https://dist.neo4j.com/wp-content/uploads/mcp-data-modeling-claude-data-model-1-viz.png[width=400]
236236

237+
=== MCP-Neo4j-GDS
238+
239+
The Neo4j Graph Data Science Server (https://github.com/neo4j-contrib/gds-agent[GDS-Agent]) provides GDS algorithms as tools.
240+
241+
This allows users to ask questions that require nontrivial reasoning with graph algorithms.
242+
An LLM equipped with the GDS agent will find and execute the correct algorithms with appropriate parameters.
243+
244+
An example where an LLM with GDS Agent is able to pick shortest path and Yen's algorithm (and with small k=3) to answer a question about travel planning for a map in the Neo4j database:
245+
246+
image::gds-agent-london-underground-example.png[]
247+
248+
It currently support a large set of GDS algorithms, including:
249+
250+
* `Centrality algorithms`: Article Rank, Articulation Points, Betweenness Centrality, Bridges, CELF, Closeness Centrality,
251+
Degree Centrality, Eigenvector Centrality, PageRank, Harmonic Centrality, HITS
252+
* `Path algorithms`: Dijkstra's Shortest Path, Delta Stepping Shortest Path, Dijsktra's Single Source Shortest Path,
253+
A-Star, Yen's, Minimum Weight Spanning Tree, Minimum Weight k-Spanning Tree, Minimum Directed Steiner Tree, Prize Collecting Steiner Tree, All Pairs Shortest Path, Random Walk, BFS, DFS, Bellman-Ford Single Source Shortest Path, Longest Path
254+
* `Community detection algorithms`: Conductance, HDBSCAN, K-Core Decomposition, K-1 Coloring, K-Means Clustering,
255+
Label Propagation, Leiden, Local Clustering Coefficient, Louvain, Modularity Metric, Modularity Optimization, Strongly Connected Component, Triangle Count, Weakly Connected Component, Approximate Maximum K-Cut, Speaker-Listener Label Propagation
256+
* `Similarity algorithms`: Node similarity, Filtered Node Similarity, K-Nearest Neighbors, Filtered K-Nearest Neighbors
257+
258+
For full documentation and instructions, please refer to the repository: https://github.com/neo4j-contrib/gds-agent
259+
237260
=== MCP-Sandbox
238261

239262
The Sandbox MCP Server (https://mcp.sandbox.neo4j.com/sse) server provides tools for managing https://sandbox.neo4j.com[Neo4j Sandboxes^] instances directly from your development environment. This server simplifies the development workflow by allowing you to programmatically control your sandboxes.

0 commit comments

Comments
 (0)