Function find_paths 

pub fn find_paths<'a, D>(
    graph: &'a TopologyGraph<D>,
    from: &Address,
    to: &Address,
    search: RouteSearch<'_>,
    max_paths_per_sequence: Option<usize>,
) -> Result<Vec<Path<'a, D>>, AlgorithmError>

Every route between two tokens, one per combination of the pools serving its legs.

max_paths_per_sequence caps how many combinations each token sequence is allowed to write; see TopologyGraph::expand_path for what a cap gives up.

Errors

AlgorithmError::NoPath naming whichever of the two tokens the graph does not hold.