Struct ClosureGraph 

pub struct ClosureGraph<V, Fv, Fa> {
    vs: Fv,
    adj: Fa,
    _marker: PhantomData<fn() -> V>,
}

Fields

vs: Fv

adj: Fa

_marker: PhantomData<fn() -> V>

Implementations

impl<V, Fv, Fa> ClosureGraph<V, Fv, Fa>

pub fn new(vs: Fv, adj: Fa) -> Self

Trait Implementations

impl<V, Fv, Fa> DirectedGraph for ClosureGraph<V, Fv, Fa>

where Self: Graph,

impl<V, Fv, Fa, Iv, Ia, T> Graph for ClosureGraph<V, Fv, Fa>

where V: Eq + Copy, Iv: Iterator<Item = V>, Fv: Fn() -> Iv, Ia: Iterator<Item = (V, T)>, Fa: Fn(V) -> Ia,

type Vertex = V

type Label = T

type Vertices<'g> = Iv where V: 'g, Fv: 'g, Fa: 'g

type Neighbors<'g> = Map<Ia, fn((V, T)) -> Neighbor<V, T>> where V: 'g, Fv: 'g, Fa: 'g

fn vsize(&self) -> usize

fn vertices(&self) -> Self::Vertices<'_>

fn neighbors(&self, vertex: Self::Vertex) -> Self::Neighbors<'_>

impl<V, Fv, Fa, T> VertexMap<T> for ClosureGraph<V, Fv, Fa>

where V: Eq + Copy + Hash, T: Clone, Self: Graph<Vertex = V>,

type Vmap = (HashMap<V, T>, T)

fn construct_vmap<F>(&self, f: F) -> Self::Vmap

where F: FnMut() -> T,

fn vmap_get<'a>(&self, (map, val): &'a Self::Vmap, vid: Self::Vertex) -> &'a T

fn vmap_get_mut<'a>( &self, (map, val): &'a mut Self::Vmap, vid: Self::Vertex, ) -> &'a mut T

fn vmap_set(&self, map: &mut Self::Vmap, vertex: Self::Vertex, value: T)