›Challenge: Cypher shortest paths
2.2 · Challenge
Challenge: Cypher shortest paths
In the previous lesson, you learned that the SHORTEST 1 keyword returns a single shortest unweighted 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..
The result is a Path object, which you can pass to the length() function to find the number of hops in the path.
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