Detailed Algorithms

Dijkstra's Algorithm

Breadth-first search with weights.

A* Algorithm

Uses heuristics to guide the search.

\[ f(n) = g(n) + h(n) \]

Where: - \(g(n)\) is the cost from start to node \(n\). - \(h(n)\) is the estimated cost from \(n\) to goal.