AB,
This is really pretty good, I am impressed - it works, is commented and is correct.
If I am being pedantic I have the following comments.
1] Use LDQueue rather than a comma list, but the LDText.Split list is a reasonable way.
2] This is a 1D graph, I guess I was interested in navigating a 2D maze (the principle is the same with an exit when the target location is found), finding the fastest route between any 2 points (assuming it has full knowledge of the maze).
I will post my latest maze3D code that uses BFS to find a route from current positionn to random target cell (using knowledge of the maze previously discovered). See https://litdev.uk/mybb/showthread.php?ti...36#pid1936 #116.
This is really pretty good, I am impressed - it works, is commented and is correct.
If I am being pedantic I have the following comments.
1] Use LDQueue rather than a comma list, but the LDText.Split list is a reasonable way.
2] This is a 1D graph, I guess I was interested in navigating a 2D maze (the principle is the same with an exit when the target location is found), finding the fastest route between any 2 points (assuming it has full knowledge of the maze).
I will post my latest maze3D code that uses BFS to find a route from current positionn to random target cell (using knowledge of the maze previously discovered). See https://litdev.uk/mybb/showthread.php?ti...36#pid1936 #116.
![[-]](https://litdev.uk/mybb/images/collapse.png)