Function building_blocks_search::greedy_path_with_l1_heuristic

pub fn greedy_path_with_l1_heuristic<N>(
    start: &PointN<N>, 
    finish: &PointN<N>, 
    predicate: impl Fn(&PointN<N>) -> bool, 
    max_iterations: usize
) -> (bool, Vec<PointN<N>>) where
    PointN<N>: Hash + Eq + Distance + IntegerPoint,
    <PointN<N> as Point>::Scalar: Ord, 

Uses L1 distance as a heuristic to do greedy best-first search from start to finish. All points on the path must satisfy predicate.