Projecting monopartite graphs

In the previous lesson, you learned how to create basic CypherNeo4j's implementation of GQL, the ISO standard query language for graph databases. It is declarative: you describe the pattern to find, and the database decides how to find it. projectionsAn in-memory copy of part of your database that graph algorithms run against. You choose which nodes and relationships it holds.. You projected actors and movies from your database into an in-memory graph.

Now let's understand what type of graph you actually created—and why it matters for the algorithms you'll run on it.