Finding the Shortest Path

In Neo4j, you can find the shortest path between two nodesA 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 relationshipsA named, directed connection between two nodes. Every relationship has a type, a start node and an end node. like connections, friendships, or travel routes.