Heuristics: A*-algorithm 1
Aus Operations-Research-Wiki
Version vom 6. Juni 2013, 10:48 Uhr von Trahm (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „== The Idea of the Algorithm == The A* (or A star) algorithm is a search algorithm which finds the shortest path between two nodes (or in our case finds the sh…“)
The Idea of the Algorithm
The A* (or A star) algorithm is a search algorithm which finds the shortest path between two nodes (or in our case finds the shortest minimal spanning tree). It is considered as an extension of the Dijkstra algorithm, but tries to improve the runtime by using a heuristic to find the optimal solution.
