4.2 · Lesson

Practice relationship aggregation

In the previous lesson, you learned the theory behind Full definition for relationship aggregation (opens in a new tab)Collapsing the parallel relationships between two nodes into one during projection, usually carrying their count or sum as its weight.. Now you'll practice building aggregated Full 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. using count(r) to count Full definition for relationship (opens in a new tab)A named, directed connection between two nodes. Every relationship has a type, a start node and an end node. between Full definition for node (opens in a new tab)A vertex in a graph. In a property graph it can carry labels and properties. pairs.

Here's how it's done: