Trait GraphStore

pub trait GraphStore: Send {
    type Node: Send;
    type Handle: Clone + Send;

    // Required method
    fn insert(
        &mut self,
        from_handle: Option<Self::Handle>,
        node: GraphNode<Self::Node>,
    ) -> Option<(Self::Handle, &Self::Node)>;
}

A graph store is a data structure that will be built up during a graph traversal. It is used to store the results of the traversal.

Required Associated Types

type Node: Send

type Handle: Clone + Send

Required Methods

fn insert( &mut self, from_handle: Option<Self::Handle>, node: GraphNode<Self::Node>, ) -> Option<(Self::Handle, &Self::Node)>

Inserts a node into the graph store, and returns a handle to it.

If this method returns None, the node edges will not be visited.

Implementors

impl<StoreImpl> GraphStore for SkipDuplicates<StoreImpl>

where StoreImpl: GraphStore, StoreImpl::Node: Eq + Hash + Clone,

type Node = <StoreImpl as GraphStore>::Node

type Handle = <StoreImpl as GraphStore>::Handle

impl<T> GraphStore for AdjacencyMap<T>

where T: Eq + Hash + Clone + Send,

type Node = T

type Handle = T

impl<T> GraphStore for NonDeterministic<T>

where T: Send,

type Node = T

type Handle = ()