Finding Shortest Paths using Cypher

In this module, you will learn how to use the CypheriFull definition for Cypher (opens in a new tab)Neo4j's implementation of GQL, the ISO standard query language for graph databases. It is declarative: you describe the pattern to find, and the database decides how to find it. query language to find the shortest paths between pairs of nodesiFull definition for node (opens in a new tab)A vertex in a graph. In a property graph it can carry labels and properties. 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 .iata propertyiFull definition for property (opens in a new tab)A named value stored on a node or a relationship., a .name, and latitude and longitude data held in a .location point property.
• Airports have an outgoing relationshipsiFull 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. to (:Region), (:Continent), (:Country) and (:City) nodes which creates a geographical hierarchy.
• Airports are linked together through :HAS_ROUTE relationships, signifying where it is possible to travel from that airport.
• Each :HAS_ROUTE relationship has a .distance property which we will use to calculate the cost of travelling between two airports.