Function difft::diff::dijkstra::shortest_vertex_path

fn shortest_vertex_path<'s, 'b>(
    start: &'b Vertex<'s, 'b>,
    vertex_arena: &'b Bump,
    size_hint: usize,
    graph_limit: usize
) -> Result<Vec<&'b Vertex<'s, 'b>>, ExceededGraphLimit>

Return the shortest route from start to the end vertex.