2D Grid Map Connectivity Check (avoiding stack overflow)
- by SombreErmine
I am trying to create a routine in C++ that will run before a more expensive A* algorithm that checks to see if two nodes on a 2D grid map are connected or not. What I need to know is a good way to accomplish this sequentially rather than recursively to avoid overflowing the stack.
What I've Done Already
I've implemented this with ease using a…