Projection Practice

Now it's time to put your knowledge into practice. You'll create both types of projectionsiFull definition for projection (opens in a new tab)An in-memory copy of part of your database that graph algorithms run against. You choose which nodes and relationships it holds. you learned about:

• MonopartiteiFull definition for monopartite graph (opens in a new tab)A graph in which every node is the same kind of thing, so relationships connect like to like. transformations — connecting nodesiFull definition for node (opens in a new tab)A vertex in a graph. In a property graph it can carry labels and properties. through shared neighbours
• Labelled bipartiteiFull definition for bipartite graph (opens in a new tab)A graph with two kinds of node, where every relationship joins one kind to the other and never two of the same kind. projections — preserving two-partition structures