Function difft::diff::dijkstra::shortest_vertex_path

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

Return the shortest route from start to the end vertex.