Challenge: Multipartite projections
2.8 · Challenge

Challenge: Multipartite projections

You've learned how to create 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. with multiple Full definition for node (opens in a new tab)A vertex in a graph. In a property graph it can carry labels and properties. types. Now it's your turn to create one independently.

Your task: Create a Full 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. projection of Users and Genres that preserves their Full definition for label (opens in a new tab)A tag on a node that groups it with other nodes of the same kind. A node can carry more than one. and connects them through the movies they rated.