Trait FiniteColumnarGraph

pub trait FiniteColumnarGraph: ColumnarGraph<Vertices: FinSet<Elem = Self::V>, Edges: FinSet<Elem = Self::E>, Src: Column<Dom = Self::E, Cod = Self::V>, Tgt: Column<Dom = Self::E, Cod = Self::V>> {
    // Provided method
    fn iter_invalid(&self) -> impl Iterator<Item = InvalidGraphData<Self::E>> { ... }
}

A finite graph backed by columns.

Such a graph is defined in copresheaf style by two finite sets and two columns. Implementing this trait provides a blanket implementation of FinGraph.

Provided Methods

fn iter_invalid(&self) -> impl Iterator<Item = InvalidGraphData<Self::E>>

Iterates over failures to be a valid graph.

Dyn Compatibility

This trait is not dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.

Implementors

impl FiniteColumnarGraph for SkelGraph

impl<V, E, S> FiniteColumnarGraph for HashGraph<V, E, S>

where V: Eq + Hash + Clone, E: Eq + Hash + Clone, S: BuildHasher,