Module
Finding Shortest Paths using Cypher
In this module, you will learn how to use the Cypher query language to find the shortest paths between pairs of nodes in the graph.
Domain model for this course
Throughout this course, we will be querying the graph data science dataset which consists of airports and their geographical information.

(:Airport)nodes are identified by a unique.iataproperty, a.name, and latitude and longitude data held in a.locationpoint property.- Airports have an outgoing relationships to
(:Region),(:Continent),(:Country)and(:City)nodes which creates a geographical hierarchy. - Airports are linked together through
:HAS_ROUTErelationships, signifying where it is possible to travel from that airport. - Each
:HAS_ROUTErelationship has a.distanceproperty which we will use to calculate the cost of travelling between two airports.
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