What problem does it solve? Running graph algorithms on Neo4j requires correct graph projection, memory estimation, execution mode selection, and version-aware API usage, and mistakes cause OOM errors, failed projections, or unqueryable results. This Skill provides verified patterns for the embedded GDS plugin so algorithms run correctly the first time. ## Core Features & Use Cases - Graph Projection & Catalog Management: Native and Cypher projection, undirected orientation, subgraph filtering, memory estimation, and graph drop/list operations. - Core Algorithms with Correct Modes: PageRank, Louvain, Leiden, WCC, Betweenness Centrality, Node Similarity, FastRP, and KNN with stream/stats/mutate/write guidance and v2 Python client endpoints. - Recommendation Pipelines: The FastRP → KNN pattern for building similarity relationships from node embeddings, ready for Neo4j vector indexes. - Use Case: A data engineer needs product recommendations from a co-purchase graph. The Skill projects the graph undirected, estimates memory, mutates FastRP embeddings, writes KNN similarity relationships, and drops the projection cleanly. ## Quick Start Ask the agent to project a Person KNOWS graph in Neo4j and run PageRank using the GDS Python client, writing the scores back to the database.