Crate building_blocks_search

Functions

find_surface_points	Returns the "surface points" i.e. those points that are non-empty and Von-Neumann-adjacent to an empty point. Since this algorithm does adjacency checks for all points in extent, you must ensure that those points are within the bounds of map.
greedy_best_first
greedy_path	Uses the given heuristic to do greedy best-first search from start to finish. All points on the path must satisfy predicate. Returns true iff the path reaches finish. Otherwise, the path that got closest to finish is returned after max_iterations.
greedy_path_with_l1_heuristic	Uses L1 distance as a heuristic to do greedy best-first search from start to finish. All points on the path must satisfy predicate.