Dijkstra’s Algorithm: Explores all possible paths using greedy selection. A* (A-star) Algorithm: Uses both actual distance and heuristic (estimated cost to goal) to guide the search more efficiently.