GraphalgorithmenAdvanced
A*-Suchalgorithmus
Ein Best-First-Suchalgorithmus, der den kurzesten Pfad unter Verwendung von Heuristiken findet. Kombiniert Dijkstras Algorithmus und Greedy-Best-First-Suche mit f(n) = g(n) + h(n). Weit verbreitet in Spielen, Robotik und GPS-Navigation fur effiziente Pfadfindung.
#graph#pathfinding#heuristic#games#ai
Complexity Analysis
Time (Average)
O(E)Expected case performance
Space
O(V)Memory requirements
Time (Best)
O(E)Best case performance
Time (Worst)
O(b^d)Worst case performance
Step: 1 / 0
500ms
SlowFast
Keyboard Shortcuts
Space Play/Pause← → StepR Reset1-4 Speed
Real-time Statistics
Algorithm Performance Metrics
Progress0%
Comparisons
0
Swaps
0
Array Accesses
0
Steps
1/ 0
Presets:
Grid Visualization
S
E
Start
End
Wall
Current
Open Set
Closed Set
Path
Ready to start A* Search
Explored
0
Open Set
0
Path Length
0
Phase
init
A* Search Algorithm
Best-first search algorithm using heuristic function to find shortest path.
Formula: f(n) = g(n) + h(n)
Time: O(E) with good heuristic | Space: O(V)
Code Execution
Currently executing
Previously executed
Implementation