Suggestion

[r3a1d3a1]

Enjoyed reading about the problem and your solution. A minor improvement: Topological sort is slightly faster than Dijkstra: https://en.wikipedia.org/wiki/Shortest_path_problem#Directed_acyclic_graphs_(DAGs)

[noahbaculi]

Hey @r3a1d3a1, that's a great idea! I'd love to see a comparison of both options in this use case. I love the open and collaborative nature of this project and this should be a relatively minor change so feel free to open a PR with some benchmarking! Here are some resources that may be useful:

• Pathfinding crate topological sort
• University of Tennessee, Knoxville: Dijkstra vs Topological Sort
• Big O notation represents an algorithm's worst case complexity

[r3a1d3a1]

Second link was pretty cool... Thanks for sharing! #AmortizedAnalysis