Weighted Shortest Paths
In a iFull definition for property graph (opens in a new tab)The data model Neo4j implements, in which nodes and relationships both carry properties as well as labels and types., iFull 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. can have iFull definition for property (opens in a new tab)A named value stored on a node or a relationship. assigned to them. In graph theory, relationship properties are referred to as weights. A weight is a numerical property which represents the cost of traversing that relationship, whether that is distance, time, financial cost or any other factor.

Join GraphAcademy to keep learning
Create your account to unlock 80+ hours of hands-on Neo4j courses, track your progress, and earn a certificate when you complete the course.
Sign in or register