Module bevy::utils::petgraph::algo::simple_paths

source ·

Functions

  • all_simple_paths
    Returns an iterator that produces all simple paths from from node to to, which contains at least min_intermediate_nodes nodes and at most max_intermediate_nodes, if given, or limited by the graph’s order otherwise. The simple path is a path without repetitions.