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