pathfinding
A family of algorithms that find routes through a graph. What counts as the best route differs by algorithm.
Learn more in Weighted Shortest Paths
Example
Two routes from Ashford to Croydon. One uses a single relationship, the other costs less.
Breadth First Search returns Ashford to Croydon, which uses one relationship.
Dijkstra returns Ashford to Barnet to Croydon, which costs 5 instead of 10.
Lessons that use this term
The lesson and course links below open in a new tab.
No published lesson uses this term yet.