Course · Part of Graph Data Science
Path Finding with GDS
Learn how to find the shortest paths between pairs of nodes in the graph
About this course
In this 1-hour course, you will learn
This course teaches you how to find the shortest paths between pairs of nodes in the graph and includes examples for both weighted and unweighted relationships.
The course automatically creates a new graph data science sandbox within Neo4j Sandbox 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