GraphAcademy
Course · Part of Graph Data Science

Path Finding with GDS

Learn how to find the shortest paths between pairs of nodes in the graph

1 hour8 lessons across 3 modules
Graph Data ScienceData ScientistAnalyticsAdvanced
About this course

In this 1-hour course, you will learn

This course teaches you how to find the shortest paths between pairs of Full 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 and includes examples for both weighted and unweighted Full 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..

In the first lesson, you will create a free Neo4j Sandbox pre-loaded with the Go to glossary for graph data science (opens in a new tab)Analysing data through the structure of its connections. Also the name of the Neo4j library that implements it. library and the airport routes dataset that you will use throughout the course.

Prerequisites

This course is intended for analysts and data scientists who have basic knowledge of:

  • Shortest paths

  • GDS algorithms

  • Weighted/Unweighted relationships

Course content

3 modules, 1 hour.

  1. 2 lessons
    1. Why use graphs5 min
    2. Set up your environment5 min
  2. 3 lessons
    1. Shortest Paths with Cypher5 min
    2. Challenge: Cypher shortest paths5 min
    3. Challenge: Cypher all shortest paths5 min
  3. 3 lessons
    1. Weighted Shortest Paths5 min
    2. Challenge: Dijkstra's Source-Target Shortest Path5 min
    3. Challenge: Source-Target Shortest Path5 min
Where to next

Keep going on Graph Data Science.

View the full path
Up next in path

Understand centrality algorithms

2 hoursStart
Later in path

Neo4j Graph Data Science Certification

1 hourStart