Graph Traversal Algorithms

A* Algorithm

Optimal pathfinding algorithm combining heuristic and actual cost, using an evaluation function f(n) = g(n) + h(n) to efficiently guide exploration.

← Kembali