Struct DependencyGraphConfig 

#[non_exhaustive]
pub struct DependencyGraphConfig {
    pub enable_cycle_detection: bool,
    pub max_depth: usize,
    pub topological_order: TopologicalAlgorithm,
}

Configuration for DependencyGraph behaviour.

Fields (Non-exhaustive)

Non-exhaustive structs could have additional fields added in future. Therefore, non-exhaustive structs cannot be constructed in external crates using the traditional Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.

enable_cycle_detection: bool

Whether to eagerly detect cycles when adding edges. Default: true.

max_depth: usize

Maximum DFS depth before aborting to prevent stack overflow. Default: 1000.

topological_order: TopologicalAlgorithm

Default algorithm for DependencyGraph::topological_sort.

Trait Implementations

impl Clone for DependencyGraphConfig

fn clone(&self) -> DependencyGraphConfig

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for DependencyGraphConfig

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for DependencyGraphConfig

fn default() -> Self

Returns the “default value” for a type.