Weighted Shortest Paths

In a property graphThe data model Neo4j implements, in which nodes and relationships both carry properties as well as labels and types., relationshipsA named, directed connection between two nodes. Every relationship has a type, a start node and an end node. can have propertiesA 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.