Projecting bipartite and multipartite graphs

In the previous lessons, you learned that GDSAnalysing data through the structure of its connections. Also the name of the Neo4j library that implements it. creates unlabelled projectionsAn in-memory copy of part of your database that graph algorithms run against. You choose which nodes and relationships it holds. by default—preserving graph structure but stripping away nodeA vertex in a graph. In a property graph it can carry labels and properties. labelsA tag on a node that groups it with other nodes of the same kind. A node can carry more than one. and relationshipA named, directed connection between two nodes. Every relationship has a type, a start node and an end node. types.

You also learned that some algorithms, like PageRankA centrality algorithm that scores a node by the number of nodes pointing at it and by how important those nodes are., produce poor results on bipartiteA graph with two kinds of node, where every relationship joins one kind to the other and never two of the same kind. structures because the structure itself traps their computations.