What is undirected relationship?

Example

Each [:KNOWS] relationship is stored one way, from Ava to Ben and from Ben to Cleo. Projecting them undirected represents each as parallel relationships in opposite directions.

cypher

MATCH (source:Person)-[:KNOWS]->(target:Person)
RETURN gds.graph.project(
  'people',
  source,
  target,
  {},
  {undirectedRelationshipTypes: ['*']}
)

Degree centrality run against people scores Ben 2. Each relationship goes out of both of its nodes, so the one from Ava counts for Ben as much as the one to Cleo. Ava and Cleo each score 1.

Lessons that use this term

The lesson and course links below open in a new tab.

21 lessons use this term. Results are ordered by term density.

Get started with Graph Data Science51 mentions

Configuring projections for undirected relationshipsWorking with algorithmsBut some algorithms work differently—or better—when relationships are undirected28 mentions
Module recap and what's nextWorking with algorithmsAttributes - Check whether the algorithm supports directed, undirected, weighted, or heterogeneous graphs Syntax - Find required parameters and modes Configuration - Explore4 mentions
Configuring projections with unweighted relationshipsWorking with algorithmsProject User and Movie nodes with RATED relationships Make relationships undirected (Leiden requires this) No relationship properties4 mentions
Module recapEssential projection techniquesoptions Attributes - Check whether the algorithm supports directed, undirected, weighted, or heterogeneous4 mentions
Understand GDS documentationWorking with algorithmsrun on a directed graph (where relationships have a specific direction) Undirected: Whether or not the algorithm can run on an undirected graph (where relationships have no direction) -5 mentions
Practice relationship aggregationEssential projection techniquesit undirected2 mentions
Challenge: Aggregated projection and analysisEssential projection techniquesgraph (preserving both Director and Actor labels) Make relationships undirected1 mention
Challenge: Weighted graph projection and analysisWorking with algorithmslearned how to project graphs with undirected relationships and1 mention
Understand relationship aggregationEssential projection techniqueshave also learned how to project undirected relationships1 mention
Running algorithmsWorking with algorithmsaffects algorithm behavior—specifically, how to change relationships to undirected and run PageRank and1 mention

Graph Data Science in Practice23 mentions

Projection Configuration for AlgorithmsGDS FoundationsCreate undirected projections for algorithms that require them Include relationship weights to represent connection strength Project16 mentions
Algorithm CategoriesGDS Foundationsshowing graph requirements for algorithms: Leiden needs undirected, Pathfinding needs weighted, Node Similarity for bipartite2 mentions
Workshop Complete!Community Detection for FraudExecution modes (stream, stats, mutate, write) Projection configuration for undirected relationships, weights, and node1 mention
Reducing Search Space with LouvainCommunity Detection for Fraudundirected for HAS_CC and2 mentions
Degree Centrality & WCCCommunity Detection for Fraud| | --- | --- | | Unsampled | Directed graphs (default) | | Sampled | Undirected graphs, or directed with inverse index1 mention
Louvain Community DetectionCommunity Detection for FraudThis creates an undirected graph where actors are connected if they've appeared in the same1 mention

Introduction to Graph Databases Workshop2 mentions

Finding the Shortest PathCypherYou can use directed or undirected relationships in shortest path2 mentions

Analyze Graph Data with Python5 mentions

Dijkstra's Shortest PathAura Graph AnalyticsDirected or undirected graphs Heterogeneous nodes — Multiple node labels supported Heterogeneous relationships — Multiple3 mentions
From Cypher to Native ProjectionGDS Python Clientand relationship properties in projections Set relationship orientation (undirected, reverse) Handle missing properties with default values Choose between gds.graph.project() and1 mention
Betweenness CentralityGDS Python Clientmany node pairs Memory usage increases with the level of parallelism Undirected graphs are more expensive than directed1 mention

AI on Your Lakehouse: Context Comes in Shapes, Not Queries1 mention

Build the Themes ToolSurface Themes - Communitiesgraph is undirected (only the connection matters, not which document linked first) and weighted by how many links two documents share1 mention

All glossary terms