Function dijkstra 

pub fn dijkstra<N, E>(
    graph: &Graph<N, E>,
    start: NodeId,
    end: NodeId,
) -> Option<Path>

Dijkstra’s shortest path from start to end.