Is there any out-of-the-box procedure to find all nodes of a GridGraph which have a certain shortest path length (or less) to a start node?
Such as:
List<GridNode> GetAllReachableNodes(GridNode startNode, int maxShortestPathLength) {…}
Thanks a lot for any support!