Crate example

A* Pathfinding Example

This example demonstrates how to use the A* pathfinding algorithm to find the shortest path on a 10x10 grid. The grid consists of open cells (0) and blocked cells (1). Users can manually adjust the neighbors and block statuses of specific nodes and find the shortest path from a start point to a goal point.

The example includes:

• Defining a 10x10 grid with open and blocked cells
• Converting the grid into a map of Node objects
• Manually adjusting neighbors and blocking nodes
• Using the A* algorithm to find the shortest path from a start to a goal
• Printing the grid with the found path and handling any errors