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>>>
| 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>> |
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>> |
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>> |
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>> |
bfPath(G graph,
N node,
A a) |
StrictQueue<Tuple2<Maybe<E>,N>> |
checkedApply(G startGraph,
N startNode,
A a) |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitapply, apply, apply, checkedApply, compose, contraMap, diMapL, discardR, flip, fn3, fn3, fn3, uncurry, widencheckedApply, curried, curry, fn2, fromBiFunction, toBiFunctionpublic 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()
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)
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)
Copyright © 2020. All Rights Reserved.