Function astar 

pub fn astar<N, E, H>(
    graph: &Graph<N, E>,
    start: NodeId,
    end: NodeId,
    heuristic: H,
) -> Option<Path>
where
    H: Fn(NodeId) -> f32,

A* shortest path with a heuristic function.