Skip to main content

Table 1 Temporal and spatial complexity of Dijkstra, A* and MDijkstra algorithms

From: Algorithm for shortest path search in Geographic Information Systems by using reduced graphs

Algorithm Temporal complexity Temporal complexity (using Heap data structure) Spatial complexity
Dijkstra O(|E| + |V|2) O(|V| + log(|V|)) O(|E| + |V|)
A* O(|V|), if the selected heuristic is optimal O(|V|), if the selected heuristic is optimal O(|E| + |V|)
MDijkstra O(|E| + |V|2) O(|V| + log(|V|)) O(|E| + |V|) + |R|