Challenge: Aggregated projection and analysis
You've learned how to aggregate iFull 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. during iFull 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 relationships between iFull definition for node (opens in a new tab)A 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.
Join GraphAcademy to keep learning
Create your account to unlock 80+ hours of hands-on Neo4j courses, track your progress, and earn a certificate when you complete the course.
Sign in or register