ALAAAAAAARMMMM!!!!
It was a sunny day in the city when suddenly an emergency call came in. A house was on fire, and the fire department had to act quickly to save lives and extinguish the fire. The firefighters rushed to their vehicles and started their engines, but which route was the fastest and safest?
The fire department employed an algorithm to find the best route to the burning house. They had various algorithms to choose from, but which one was the best? Can you select the algorithm that will help the fire department reach the house as quickly and safely as possible?
Choose the correct algorithm to assist the fire department in reaching the burning house as quickly as possible and saving lives:
GRAPH OPTIONS:
- Reset Graph: This function resets the entire graph by restoring all fields to their initial state. This means that all start, target, and unvisited fields are cleared, and the graph is ready to be reconfigured.
- Reset Walls: This function specifically resets the walls in the graph, while leaving the start, target, and unvisited fields unchanged. By resetting the walls, any previously placed obstacles or barriers are removed, allowing the graph to be reconfigured with new walls.
BUTTON OPTIONS:
- Start (Green Button): Choose this color to set the next selected node as the starting node.
- Target (Red Button): Choose this color to set the next selected node as the target node.
- Wall (Black Button): Choose this color to set the next selected node as an obstacle (wall).
- DELETE WALL (White Button): Choose this color to set the next selected node as an unvisited node or do delete wall.
BEGIN:
- Execute: Start the execution of the pathfinding algorithm.
ANALYZE:
- Heuristic: Analyze the impact of the heuristic on the algorithm.
- G-Cost: Analyze the impact of the G-cost on the algorithm.
- F-Cost: Analyze the impact of the F-cost on the algorithm.
FIELD SELECTION:
- Choose fields by left-clicking
- Delete chosen fields by right-clicking
ADDITIONAL INFORMATION:
- Yellow: Path Node
- Blue: Expanded Node