›Challenge: Monopartite projection
2.5 · Challenge
Challenge: Monopartite projection
You've learned how to create various iFull 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. 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.. Now it's your turn to create one independently.
In this challenge, you will need to think somewhat outside the box.
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