Uses of Class
io.ataraxic.nomicflux.voyageur.impl.ValueEdge

Packages that use ValueEdge

Package	Description
io.ataraxic.nomicflux.voyageur.impl

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

Methods in io.ataraxic.nomicflux.voyageur.impl that return ValueEdge

Modifier and Type	Method and Description
static <A,L> ValueEdge<A,L,Unit>	ValueEdge.edgeFromTo(ValueNode<A,L> from, ValueNode<A,L> to) Create an edge from one node to another, with no weight information
static <A,L> ValueEdge<A,L,Unit>	ValueEdge.edgeToFrom(ValueNode<A,L> to, ValueNode<A,L> from) Create an edge to one node from another, with no weight information
ValueEdge<A,L,W>	ValueEdge.swap()
static <A,L,W> ValueEdge<A,L,W>	ValueEdge.weightedEdgeFromTo(ValueNode<A,L> from, ValueNode<A,L> to, W weight) Create an edge from one node to another with weight metadata
static <A,L,W> ValueEdge<A,L,W>	ValueEdge.weightedEdgeToFrom(ValueNode<A,L> to, ValueNode<A,L> from, W weight) Create an edge to one node from another with weight metadata

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

Modifier and Type	Method and Description
Choice2<AdjListGraph<A,L,W>,Tuple2<Context<A,ValueNode<A,L>,ValueEdge<A,L,W>,HashSet<ValueEdge<A,L,W>>>,AdjListGraph<A,L,W>>>	AdjListGraph.atNode(ValueNode<A,L> node) Decompose a graph at a given Node into the node's Context and the rest of the graph
Choice2<AdjListGraph<A,L,W>,Tuple2<Context<A,ValueNode<A,L>,ValueEdge<A,L,W>,HashSet<ValueEdge<A,L,W>>>,AdjListGraph<A,L,W>>>	AdjListGraph.atNode(ValueNode<A,L> node) Decompose a graph at a given Node into the node's Context and the rest of the graph
Maybe<Tuple2<Context<A,ValueNode<A,L>,ValueEdge<A,L,W>,HashSet<ValueEdge<A,L,W>>>,AdjListGraph<A,L,W>>>	AdjListGraph.decompose() Implementation-dependent and possibly non-deterministic decomposition of a graph into a Context and the rest of the graph
Maybe<Tuple2<Context<A,ValueNode<A,L>,ValueEdge<A,L,W>,HashSet<ValueEdge<A,L,W>>>,AdjListGraph<A,L,W>>>	AdjListGraph.decompose() Implementation-dependent and possibly non-deterministic decomposition of a graph into a Context and the rest of the graph
static <A,L> Fn1<ValueNode<A,L>,ValueEdge<A,L,Unit>>	ValueEdge.edgeFrom(ValueNode<A,L> from)
static <A,L> Fn2<ValueNode<A,L>,ValueNode<A,L>,ValueEdge<A,L,Unit>>	ValueEdge.edgeFromTo()
static <A,L> Fn1<ValueNode<A,L>,ValueEdge<A,L,Unit>>	ValueEdge.edgeTo(ValueNode<A,L> to)
static <A,L> Fn2<ValueNode<A,L>,ValueNode<A,L>,ValueEdge<A,L,Unit>>	ValueEdge.edgeToFrom()
HashSet<ValueEdge<A,L,W>>	ValueContext.getInboundEdges()
HashSet<ValueEdge<A,L,W>>	ValueContext.getOutboundEdges()
static <A,L,W> Fn2<ValueNode<A,L>,W,ValueEdge<A,L,W>>	ValueEdge.weightedEdgeFrom(ValueNode<A,L> from) Curried function creating an edge from a given node
static <A,L,W> Fn3<ValueNode<A,L>,ValueNode<A,L>,W,ValueEdge<A,L,W>>	ValueEdge.weightedEdgeFromTo()
static <A,L,W> Fn1<W,ValueEdge<A,L,W>>	ValueEdge.weightedEdgeFromTo(ValueNode<A,L> from, ValueNode<A,L> to)
static <A,L,W> Fn2<ValueNode<A,L>,W,ValueEdge<A,L,W>>	ValueEdge.weightedEdgeTo(ValueNode<A,L> to) Curried function creating an edge to a given node
static <A,L,W> Fn3<ValueNode<A,L>,ValueNode<A,L>,W,ValueEdge<A,L,W>>	ValueEdge.weightedEdgeToFrom()
static <A,L,W> Fn1<W,ValueEdge<A,L,W>>	ValueEdge.weightedEdgeToFrom(ValueNode<A,L> to, ValueNode<A,L> from)

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

Modifier and Type	Method and Description
AdjListGraph<A,L,W>	AdjListGraph.addEdge(ValueEdge<A,L,W> edge)
static <A,L,W> AdjListGraph<A,L,W>	AdjListGraph.fromEdge(ValueEdge<A,L,W> edge) Create an AdjListGraph with a single ValueEdge and the attached ValueNodes
AdjListGraph<A,L,W>	AdjListGraph.removeEdge(ValueEdge<A,L,W> edge)

Method parameters in io.ataraxic.nomicflux.voyageur.impl with type arguments of type ValueEdge

Modifier and Type	Method and Description
static <A,L,W> ValueContext<A,L,W>	ValueContext.context(ValueNode<A,L> node, HashSet<ValueEdge<A,L,W>> outboundEdges, HashSet<ValueEdge<A,L,W>> inboundEdges) Create a new Context
static <A,L,W> ValueContext<A,L,W>	ValueContext.context(ValueNode<A,L> node, HashSet<ValueEdge<A,L,W>> outboundEdges, HashSet<ValueEdge<A,L,W>> inboundEdges) Create a new Context
static <A,L,W> AdjListGraph<A,L,W>	AdjListGraph.fromEdges(Iterable<ValueEdge<A,L,W>> edges) Create an AdjListGraph from an iterable of ValueEdge