io.ataraxic.nomicflux.voyageur.search

Class BFSearch<A,N extends Node<A>,E extends Edge<A,N,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>>

Object

Search<A,N,E,I,G,StrictQueue<N>>

BFSearch<A,N,E,I,G>

All Implemented Interfaces:

Fn1<G,Fn1<N,Fn1<A,Boolean>>>, Fn2<G,N,Fn1<A,Boolean>>, Fn3<G,N,A,Boolean>, Applicative<Fn1<N,Fn1<A,Boolean>>,Fn1<G,?>>, Cartesian<G,Fn1<N,Fn1<A,Boolean>>,Fn1<?,?>>, Cocartesian<G,Fn1<N,Fn1<A,Boolean>>,Fn1<?,?>>, Contravariant<G,Profunctor<?,Fn1<N,Fn1<A,Boolean>>,Fn1<?,?>>>, Functor<Fn1<N,Fn1<A,Boolean>>,Fn1<G,?>>, Profunctor<G,Fn1<N,Fn1<A,Boolean>>,Fn1<?,?>>, Monad<Fn1<N,Fn1<A,Boolean>>,Fn1<G,?>>, MonadReader<G,Fn1<N,Fn1<A,Boolean>>,Fn1<G,?>>, MonadRec<Fn1<N,Fn1<A,Boolean>>,Fn1<G,?>>, MonadWriter<G,Fn1<N,Fn1<A,Boolean>>,Fn1<G,?>>

public final class BFSearch<A,N extends Node<A>,E extends Edge<A,N,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>>
extends Search<A,N,E,I,G,StrictQueue<N>>

Method Summary

Modifier and Type	Method and Description
static <A,N extends Node<A>,E extends Edge<A,N,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>> Fn3<G,N,A,Boolean>	bfSearch()
static <A,N extends Node<A>,E extends Edge<A,N,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>> Fn2<N,A,Boolean>	bfSearch(G graph)
static <A,N extends Node<A>,E extends Edge<A,N,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>> Fn1<A,Boolean>	bfSearch(G graph, N node)
static <A,N extends Node<A>,E extends Edge<A,N,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>> Boolean	bfSearch(G graph, N node, A a)

Methods inherited from class Search

checkedApply

Methods inherited from class Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface Fn3

apply, apply, apply, checkedApply, compose, contraMap, diMapL, discardR, flip, fn3, fn3, fn3, uncurry, widen

Methods inherited from interface Fn2

checkedApply, curried, curry, fn2, fromBiFunction, toBiFunction

Methods inherited from interface Fn1

andThen, carry, cartesian, censor, choose, cocartesian, diMap, diMapR, discardL, flatMap, fmap, fn1, fromFunction, lazyZip, listens, local, pure, pureFn1, thunk, toFunction, trampolineM, zip, zip

Methods inherited from interface Monad

join

Methods inherited from interface Functor

coerce

Method Detail

bfSearch

public static <A,N extends Node<A>,E extends Edge<A,N,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>> Fn3<G,N,A,Boolean> bfSearch()

bfSearch

public static <A,N extends Node<A>,E extends Edge<A,N,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>> Fn2<N,A,Boolean> bfSearch(G graph)

bfSearch

public static <A,N extends Node<A>,E extends Edge<A,N,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>> Fn1<A,Boolean> bfSearch(G graph,
                                                                                                                                   N node)

bfSearch

public static <A,N extends Node<A>,E extends Edge<A,N,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>> Boolean bfSearch(G graph,
                                                                                                                            N node,
                                                                                                                            A a)