Path Finding with GDS
Learning Path
Prerequisite
Neo4j Graph Data Science FundamentalsThis Course
Path Finding with GDS
Similar Courses
- Introduction to Neo4j Graph Data Science212 users who completed Path Finding with GDS have also completed Introduction to Neo4j Graph Data Science .
- Neo4j Graph Data Science Fundamentals205 users who completed Path Finding with GDS have also completed Neo4j Graph Data Science Fundamentals .
- Neo4j Fundamentals198 users who completed Path Finding with GDS have also completed Neo4j Fundamentals .
Course Description
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:
Duration
1 hour
What you will learn
-
Using Cypher to find the shortest paths between a pair of nodes
-
What is the difference between weighted and unweighted relationships
-
How to use the Neo4j Graph Data Science library to find the weighted shortest paths
Table of Contents
Get Support
If you find yourself stuck at any stage then our friendly community will be happy to help. You can reach out for help on the Neo4j Community Site, or head over to the Neo4j Discord server for instant feedback.
Feedback
If you have any comments or feedback on this course you can email us on graphacademy@neo4j.com.