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

Packages that use Node

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

Uses of Node in io.ataraxic.nomicflux.voyageur

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

Modifier and Type	Interface and Description
interface	Context<A,N extends Node<A>,E extends Edge<A,N,E>,I extends Iterable<E>> A context surrounding a Node and it's outgoing and ingoing Edges
interface	Edge<A,N extends Node<A>,E extends Edge<A,N,E>> An edge from one Node to another
interface	Graph<A,N extends Node<A>,E extends Edge<A,N,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>> Main interface for working with inductive graphs
interface	WeightedEdge<A,N extends Node<A>,W,E extends WeightedEdge<A,N,W,E>> An Edge with additional weight metadata

Subinterfaces of Node in io.ataraxic.nomicflux.voyageur

Modifier and Type	Interface and Description
interface	LabeledNode<A,L> A Node which also carries a label containing node metadata

Uses of Node in io.ataraxic.nomicflux.voyageur.fold

Classes in io.ataraxic.nomicflux.voyageur.fold with type parameters of type Node

Modifier and Type	Class and Description
class	FoldG<A,N extends Node<A>,E extends Edge<A,N,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>,S,Acc> Deprecated.

Methods in io.ataraxic.nomicflux.voyageur.fold with type parameters of type Node

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>,S,Acc> Acc	FoldG.foldG(Fn1<Context<A,N,E,I>,Boolean> destinationCheck, Fn1<S,FoldContinue<N>> contextGetter, Fn3<S,Acc,Context<A,N,E,I>,S> updateState, S defState, Fn3<S,Acc,Context<A,N,E,I>,Acc> accumulator, Acc defAcc, G graph) Deprecated.
static <A,N extends Node<A>,E extends Edge<A,N,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>,S,Acc> Acc	FoldG.guidedCutFold(Fn1<Context<A,N,E,I>,Boolean> destinationCheck, Fn1<S,FoldContinue<N>> contextGetter, Fn3<S,Acc,Context<A,N,E,I>,S> updateState, S defState, Fn3<S,Acc,Context<A,N,E,I>,Acc> accumulator, Acc defAcc, G graph) Deprecated.
static <A,N extends Node<A>,E extends Edge<A,N,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>,S,Acc> Acc	FoldG.guidedFold(Fn1<S,FoldContinue<N>> contextGetter, Fn3<S,Acc,Context<A,N,E,I>,S> updateState, S defState, Fn3<S,Acc,Context<A,N,E,I>,Acc> accumulator, Acc defAcc, G graph) Deprecated.
static <A,N extends Node<A>,E extends Edge<A,N,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>,Acc> Acc	FoldG.simpleCutFold(Fn2<Acc,Context<A,N,E,I>,Acc> accumulator, Fn1<Context<A,N,E,I>,Boolean> destinationCheck, Acc defAcc, G graph) Deprecated.
static <A,N extends Node<A>,E extends Edge<A,N,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>,Acc> Acc	FoldG.simpleFold(Fn2<Acc,Context<A,N,E,I>,Acc> accumulator, Acc defAcc, G graph) Deprecated.

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

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

Modifier and Type	Class and Description
class	ValueNode<A,L> A LabeledNode which is a value object, isomorphic to its value and label

Methods in io.ataraxic.nomicflux.voyageur.impl that return types with arguments of type Node

Modifier and Type	Method and Description
static <A,L> Fn2<Node<A>,L,ValueNode<A,L>>	ValueNode.labelNode()

Methods in io.ataraxic.nomicflux.voyageur.impl with parameters of type Node

Modifier and Type	Method and Description
static <A,L> Fn1<L,ValueNode<A,L>>	ValueNode.labelNode(Node<A> node)
static <A,L> ValueNode<A,L>	ValueNode.labelNode(Node<A> node, L label) Label an existing node.

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

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

Modifier and Type	Class and Description
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>>
class	DFPath<A,N extends Node<A>,E extends Edge<A,N,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>>
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 Node

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.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.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.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.bfPath(G graph, N node, A a)
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>>>	DFPath.dfPath()
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>>>	DFPath.dfPath(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>>>	DFPath.dfPath(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>>	DFPath.dfPath(G graph, N node, 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.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)

Uses of Node in io.ataraxic.nomicflux.voyageur.search

Classes in io.ataraxic.nomicflux.voyageur.search with type parameters of type Node

Modifier and Type	Class and Description
class	BFSearch<A,N extends Node<A>,E extends Edge<A,N,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>>
class	DFSearch<A,N extends Node<A>,E extends Edge<A,N,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>>
class	Search<A,N extends Node<A>,E extends Edge<A,N,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>,S>

Methods in io.ataraxic.nomicflux.voyageur.search with type parameters of type Node

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,Boolean>	BFSearch.bfSearch()
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,Boolean>	BFSearch.bfSearch(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,Boolean>	BFSearch.bfSearch(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>> Boolean	BFSearch.bfSearch(G graph, N node, A a)
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,Boolean>	DFSearch.dfSearch()
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,Boolean>	DFSearch.dfSearch(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,Boolean>	DFSearch.dfSearch(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>> Boolean	DFSearch.dfSearch(G graph, N node, A a)