Used for static data sets: those that are unlikely to change.

Used to navigate through a graph to find the best possible route from one node to another.

Is ridiculously long for large data sets and the organisation of open and closed sets (the nodes available that haven't been explored) is key to the run time and efficiency of the algorithm.

Works on weighted graphs, which can be directed or undirected.

Each node you decide to visit comes with a cost. This is not necessarily to do with geographical distance.

HOW IT WORKS:

Set all node costs (except start) to infinite cost. Then the lowest cost is selected.

	Criado por Harriet Leplar mais de 5 anos atrás

A Level CS

Dijkstra vs A* Algorithm.