io.ataraxic.nomicflux.voyageur.path

Class Dijkstra<A,N extends Node<A>,W extends Comparable<W>,E extends WeightedEdge<A,N,W,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>>

Object

Dijkstra<A,N,W,E,I,G>

All Implemented Interfaces:

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

public final class Dijkstra<A,N extends Node<A>,W extends Comparable<W>,E extends WeightedEdge<A,N,W,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>>
extends Object
implements Fn4<Monoid<W>,G,N,A,StrictQueue<Tuple2<W,N>>>

Method Summary

Modifier and Type	Method and Description
StrictQueue<Tuple2<W,N>>	checkedApply(Monoid<W> wMonoid, G startGraph, N startNode, A a)
static <A,N extends Node<A>,W extends Comparable<W>,E extends WeightedEdge<A,N,W,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>> Fn4<Monoid<W>,G,N,A,StrictQueue<Tuple2<W,N>>>	dijkstra()
static <A,N extends Node<A>,W extends Comparable<W>,E extends WeightedEdge<A,N,W,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>> Fn3<G,N,A,StrictQueue<Tuple2<W,N>>>	dijkstra(Monoid<W> wMonoid)
static <A,N extends Node<A>,W extends Comparable<W>,E extends WeightedEdge<A,N,W,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>> Fn2<N,A,StrictQueue<Tuple2<W,N>>>	dijkstra(Monoid<W> wMonoid, G graph)
static <A,N extends Node<A>,W extends Comparable<W>,E extends WeightedEdge<A,N,W,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>> Fn1<A,StrictQueue<Tuple2<W,N>>>	dijkstra(Monoid<W> wMonoid, G graph, N node)
static <A,N extends Node<A>,W extends Comparable<W>,E extends WeightedEdge<A,N,W,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>> StrictQueue<Tuple2<W,N>>	dijkstra(Monoid<W> wMonoid, G graph, N node, A a)

Methods inherited from class Object

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

Methods inherited from interface Fn4

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

Methods inherited from interface Fn3

checkedApply, fn3, fn3, fn3

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<W,N>> checkedApply(Monoid<W> wMonoid,
                                             G startGraph,
                                             N startNode,
                                             A a)

Specified by:

checkedApply in interface Fn4<Monoid<W extends Comparable<W>>,G extends Graph<A,N,E,I,G>,N extends Node<A>,A,StrictQueue<Tuple2<W extends Comparable<W>,N extends Node<A>>>>

dijkstra

public static <A,N extends Node<A>,W extends Comparable<W>,E extends WeightedEdge<A,N,W,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>> Fn4<Monoid<W>,G,N,A,StrictQueue<Tuple2<W,N>>> dijkstra()

dijkstra

public static <A,N extends Node<A>,W extends Comparable<W>,E extends WeightedEdge<A,N,W,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>> Fn3<G,N,A,StrictQueue<Tuple2<W,N>>> dijkstra(Monoid<W> wMonoid)

dijkstra

public static <A,N extends Node<A>,W extends Comparable<W>,E extends WeightedEdge<A,N,W,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>> Fn2<N,A,StrictQueue<Tuple2<W,N>>> dijkstra(Monoid<W> wMonoid,
                                                                                                                                                                                        G graph)

dijkstra

public static <A,N extends Node<A>,W extends Comparable<W>,E extends WeightedEdge<A,N,W,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>> Fn1<A,StrictQueue<Tuple2<W,N>>> dijkstra(Monoid<W> wMonoid,
                                                                                                                                                                                      G graph,
                                                                                                                                                                                      N node)

dijkstra

public static <A,N extends Node<A>,W extends Comparable<W>,E extends WeightedEdge<A,N,W,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>> StrictQueue<Tuple2<W,N>> dijkstra(Monoid<W> wMonoid,
                                                                                                                                                                               G graph,
                                                                                                                                                                               N node,
                                                                                                                                                                               A a)