io.ataraxic.nomicflux.voyageur.path

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

Object

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

All Implemented Interfaces:

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

public final class BFPath<A,N extends Node<A>,E extends Edge<A,N,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>>
extends Object
implements Fn3<G,N,A,StrictQueue<Tuple2<Maybe<E>,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,StrictQueue<Tuple2<Maybe<E>,N>>>	bfPath()
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,StrictQueue<Tuple2<Maybe<E>,N>>>	bfPath(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,StrictQueue<Tuple2<Maybe<E>,N>>>	bfPath(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>> StrictQueue<Tuple2<Maybe<E>,N>>	bfPath(G graph, N node, A a)
StrictQueue<Tuple2<Maybe<E>,N>>	checkedApply(G startGraph, N startNode, A a)

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

checkedApply

public StrictQueue<Tuple2<Maybe<E>,N>> checkedApply(G startGraph,
                                                    N startNode,
                                                    A a)

Specified by:

checkedApply in interface Fn3<G extends Graph<A,N,E,I,G>,N extends Node<A>,A,StrictQueue<Tuple2<Maybe<E extends Edge<A,N,E>>,N extends Node<A>>>>

bfPath

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,StrictQueue<Tuple2<Maybe<E>,N>>> bfPath()

bfPath

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,StrictQueue<Tuple2<Maybe<E>,N>>> bfPath(G graph)

bfPath

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,StrictQueue<Tuple2<Maybe<E>,N>>> bfPath(G graph,
                                                                                                                                                         N node)

bfPath

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>> StrictQueue<Tuple2<Maybe<E>,N>> bfPath(G graph,
                                                                                                                                                  N node,
                                                                                                                                                  A a)