Project a graph

In the previous lesson, you learned the three-step GDSAnalysing data through the structure of its connections. Also the name of the Neo4j library that implements it. workflow: Project → Run → Write. You saw how this pattern enables fast, safe, iterative analysis by separating your source data from algorithmic operations.

This lesson focuses exclusively on Step 1: ProjectionAn in-memory copy of part of your database that graph algorithms run against. You choose which nodes and relationships it holds.—the foundation of all GDS work.