- 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,?>>
- Direct Known Subclasses:
- BFSearch, DFSearch
public abstract class Search<A,N extends Node<A>,E extends Edge<A,N,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>,S>
extends Object
implements Fn3<G,N,A,Boolean>