Dijkstra's Shortest Path
Before running Full definition for Dijkstra's algorithm (opens in a new tab)An algorithm that finds the cheapest route between two nodes.'s on our logistics network, let's understand what it does, how it works internally, and how to configure it for different use cases.
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