Finding Paths

The SHORTEST keyword finds the shortest path between two nodesA vertex in a graph. In a property graph it can carry labels and properties., however many relationshipsA named, directed connection between two nodes. Every relationship has a type, a start node and an end node. and nodes lie between them. Paths are useful for queries about connections, friendships, or travel routes.

Predict the number of relationships in the path between Tom Hanks and Meg Ryan, then run the query.