Pathfinding algorithms Flashcards
1
Q
Define Dijkstra’s algorithm
A
finding shortest path between two nodes
2
Q
Where is Dijkstra’s used?
A
- managing networks
- guide cars along a route
3
Q
Disadvantages of Dijkstra’s
A
can be inefficient for searching for shortest path to one specific target
