Uses of Interface
io.ataraxic.nomicflux.voyageur.WeightedEdge

Packages that use WeightedEdge

Package	Description
io.ataraxic.nomicflux.voyageur
io.ataraxic.nomicflux.voyageur.impl
io.ataraxic.nomicflux.voyageur.path

Uses of WeightedEdge in io.ataraxic.nomicflux.voyageur

Classes in io.ataraxic.nomicflux.voyageur with type parameters of type WeightedEdge

Modifier and Type	Interface and Description
interface	WeightedEdge<A,N extends Node<A>,W,E extends WeightedEdge<A,N,W,E>> An Edge with additional weight metadata

Uses of WeightedEdge in io.ataraxic.nomicflux.voyageur.impl

Classes in io.ataraxic.nomicflux.voyageur.impl that implement WeightedEdge

Modifier and Type	Class and Description
class	ValueEdge<A,L,W> A WeightedEdge which is a value object, isomorphic to the two ValueNodes it connects and its weight.

Uses of WeightedEdge in io.ataraxic.nomicflux.voyageur.path

Classes in io.ataraxic.nomicflux.voyageur.path with type parameters of type WeightedEdge

Modifier and Type	Class and Description
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>>

Methods in io.ataraxic.nomicflux.voyageur.path with type parameters of type WeightedEdge

Modifier and Type	Method and Description
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()
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.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.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.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.dijkstra(Monoid<W> wMonoid, G graph, N node, A a)