Please enable JavaScript.

Coggle requires JavaScript to display documents.

Path Finding Algorithms - Coggle Diagram

- - - - Description: Uses both actual cost from the start and estimated cost to the goal (heuristic).
      - Uses both actual cost (g) and heuristic (h).
      - Balances between exploration and exploitation.
      - Ensures optimal path if heuristic is admissible.
      - Efficiently finds shortest path to the goal.
    - - Expands the node that appears to be closest to the goal using a heuristic.
      - Uses only heuristic (h).
      - Focuses on exploring the most promising path.
      - Faster but may not find the optimal path.
      - Good for problems where speed is prioritized over optimality.
    - - Initialize distances: source node (0), others (infinity).
      - Use a priority queue to select the smallest distance node.
      - Update distances to neighboring nodes if a shorter path is found.
      - Repeat until all nodes are visited or the queue is empty.