Challenge: Aggregated projection and analysis

You've learned how to aggregate relationshipsA named, directed connection between two nodes. Every relationship has a type, a start node and an end node. during projectionAn 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 relationships between nodeA vertex in a graph. In a property graph it can carry labels and properties. pairs. Now it's time to apply these skills independently.

In this challenge, you'll design and build an aggregated projection from scratch, then analyze it with an algorithm of your choice.