Function bounded_simple_paths

pub fn bounded_simple_paths<'a, G>(
    graph: &'a G,
    from: &'a G::V,
    to: &'a G::V,
    max_length: Option<usize>,
) -> impl Iterator<Item = Path<G::V, G::E>> + 'a
where
    G: FinGraph,
    G::V: Hash,
    G::E: Hash,

Iterates over all simple paths of bounded length between two vertices.

Works like simple_paths, with the same definition of simple path, but the returned paths are also optionally restricted to those of bounded length. The length of a path is the number of edges in it.