Configuring projections with unweighted relationships

So far, you've treated all relationshipsA named, directed connection between two nodes. Every relationship has a type, a start node and an end node. equally. But what if some connections are stronger than others?

In this lesson, you'll create a user-movie bipartiteA graph with two kinds of node, where every relationship joins one kind to the other and never two of the same kind. network using rating data and run Leiden community detectionA family of algorithms that group nodes by how they connect. Each algorithm defines a community differently. with and without relationship weights.