Configuring projections for undirected relationships

In the previous lesson, you ran algorithms on directed relationshipsiFull definition for directed relationship (opens in a new tab)A relationship that runs one way, from its start node to its end node. Every relationship Neo4j stores is directed.. But some algorithms work differently—or better—when relationshipsiFull 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. are undirectediFull definition for undirected relationship (opens in a new tab)A relationship with no direction. Neo4j GDS represents them as parallel relationships in opposite directions..

In this lesson, you'll configure your projectioniFull 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. to use undirected relationships and run PageRankiFull definition for PageRank (opens in a new tab)A centrality algorithm that scores a node by the number of nodes pointing at it and by how important those nodes are. and Leiden to see how the results change.