Function simple_paths

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

Iterates over all simple paths between two vertices of a finite graph.

On our definition, a simple path is a path in which all edges are distinct.

A simple cycle is a simple path in which the source and target coincide. This being a category theory library, we do consider the empty/identity path at a vertex to be a simple cycle.

References

This function is adapted from previous implementations of the same algorithm:

• all_simple_paths in petgraph
• all_simple_paths in NetworkX