Yen's K-Shortest Paths
Full definition for Dijkstra's algorithm (opens in a new tab)An algorithm that finds the cheapest route between two nodes.'s gave you the optimal route. Yen's gives you options.
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