›Finding the Shortest Path
2.6 · Lesson
Finding the Shortest Path
In Neo4j, you can find the shortest path between two iFull definition for node (opens in a new tab)A vertex in a graph. In a property graph it can carry labels and properties. using the SHORTEST [k] clause.
This is useful for queries involving 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. like connections, friendships, or travel routes.
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