If your map can be put into a two-dimensional array, there is no need to treat it as an irregular map. Regardless of whether the map is regular or not, it can be stored, but the nature is not necessarily a two-dimensional array, it may be other data structures (linked lists, sets, etc.). Mainly, you can plan the map into a data structure, and it is very convenient. Reading and writing these data is just a matter of convenience using the A star algorithm.
The key to solving the pathfinding problem of irregular maps A star is to use a reasonable data structure to represent the map, rather than having to stuff an irregular map into a two-dimensional array.
The A* algorithm is just a general graph search algorithm and has nothing to do with two-dimensional arrays. How to search depends on how the map is saved.
![[Web front-end] Node.js quick start](https://img.php.cn/upload/course/000/000/067/662b5d34ba7c0227.png)
If your map can be put into a two-dimensional array, there is no need to treat it as an irregular map. Regardless of whether the map is regular or not, it can be stored, but the nature is not necessarily a two-dimensional array, it may be other data structures (linked lists, sets, etc.). Mainly, you can plan the map into a data structure, and it is very convenient. Reading and writing these data is just a matter of convenience using the A star algorithm.
The key to solving the pathfinding problem of irregular maps A star is to use a reasonable data structure to represent the map, rather than having to stuff an irregular map into a two-dimensional array.
The A* algorithm is just a general graph search algorithm and has nothing to do with two-dimensional arrays. How to search depends on how the map is saved.