Trait Search 

pub trait Search<N> {
    type Output;

    // Required method
    fn search(&mut self, start: N) -> Result<Self::Output>;
}

The Search establishes a common interface for operators on hypergraphs capable of performing a search.

Required Associated Types

type Output

Required Methods

fn search(&mut self, start: N) -> Result<Self::Output>

begins a search of the graph, starting with the given index.

Implementors

impl<'a, N, E, A, H> Search<IndexBase<<A as GraphProps>::Ix>> for Dijkstra<'a, N, E, A, H>

where E: Copy + Default + PartialOrd + FromPrimitive + Num + UpperBounded, A: GraphProps, H: HyperGraphIter<N, E, A>, A::Ix: HyperIndex, <H::Edge<E> as RawLayout>::Store: Clone + IntoIterator<Item = VertexId<A::Ix>>,

type Output = Vec<IndexBase<<A as GraphProps>::Ix>>

impl<'a, N, E, A, H, S> Search<IndexBase<<A as GraphProps>::Ix>> for BreadthFirstTraversal<'a, N, E, A, H, S>

where A: GraphProps, H: HyperGraph<N, E, A>, S: BuildHasher, A::Ix: HyperIndex, for<'b> &'b <H::Edge<E> as RawLayout>::Store: IntoIterator<Item = &'b VertexId<A::Ix>>,

type Output = Vec<IndexBase<<A as GraphProps>::Ix>>

impl<'a, N, E, A, H, S> Search<IndexBase<<A as GraphProps>::Ix>> for DepthFirstTraversal<'a, N, E, A, H, S>

where A: GraphProps, H: HyperGraph<N, E, A>, S: BuildHasher, A::Ix: HyperIndex, for<'b> &'b <H::Edge<E> as RawLayout>::Store: IntoIterator<Item = &'b VertexId<A::Ix>>,

type Output = Vec<IndexBase<<A as GraphProps>::Ix>>

impl<'a, N, E, F, A, H, S> Search<IndexBase<<A as GraphProps>::Ix>> for AStarSearch<'a, N, E, A, F, H, S>

where A: GraphProps, F: Heuristic<A::Ix, Output = f64>, H: HyperGraphIter<N, E, A>, S: BuildHasher, A::Ix: HyperIndex, for<'b> &'b <H::Edge<E> as RawLayout>::Store: IntoIterator<Item = &'b VertexId<A::Ix>>,

type Output = Vec<IndexBase<<A as GraphProps>::Ix>>