›Challenge: Dijkstra's Source-Target Shortest Path
3.2 · Challenge
Challenge: Dijkstra's Source-Target Shortest Path
In the previous module, you learned that there are 206 shortest unweighted paths from Nashville to Phuket.
In this challenge, you will use the iFull definition for Dijkstra's algorithm (opens in a new tab)An algorithm that finds the cheapest route between two nodes. shortest path algorithm to recommend the shortest weighted path between the two airports based on the flight distance.
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