Function shortest_path 

pub fn shortest_path<C: Cell>(
    grid: &Grid<C>,
    start: (usize, usize),
    end: (usize, usize),
    constraints: &PathfindingConstraints,
) -> Option<Vec<(usize, usize)>>

Find a shortest path between two points using a Dijkstra cost map.