Pathfinding algorithms

Question 1

Define Dijkstra’s algorithm

Answer 1

finding shortest path between two nodes

Question 2

Where is Dijkstra’s used?

Answer 2

• managing networks

- guide cars along a route

Question 3

Disadvantages of Dijkstra’s

Answer 3

can be inefficient for searching for shortest path to one specific target