A B C D E F G H I L M N R S T V W

A

addEdge(E) - Method in interface Graph

addEdge() - Method in interface Graph

addEdge(ValueEdge<A, L, W>) - Method in class AdjListGraph

addNode(N) - Method in interface Graph

addNode() - Method in interface Graph

addNode(ValueNode<A, L>) - Method in class AdjListGraph

AdjListGraph<A,L,W> - Class in io.ataraxic.nomicflux.voyageur.impl

An adjacency list representation of a graph, using ValueNode, ValueEdge, and ValueContext to minimize the need supplying type parameters

atNode(N) - Method in interface Graph

Decompose a graph at a given Node into the node's Context and the rest of the graph

atNode() - Method in interface Graph

atNode(ValueNode<A, L>) - Method in class AdjListGraph

Decompose a graph at a given Node into the node's Context and the rest of the graph

B

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 in io.ataraxic.nomicflux.voyageur.path

bfPath() - Static method in class BFPath

bfPath(G) - Static method in class BFPath

bfPath(G, N) - Static method in class BFPath

bfPath(G, N, A) - Static method in class BFPath

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 in io.ataraxic.nomicflux.voyageur.search

bfSearch() - Static method in class BFSearch

bfSearch(G) - Static method in class BFSearch

bfSearch(G, N) - Static method in class BFSearch

bfSearch(G, N, A) - Static method in class BFSearch

C

checkedApply(Fn1<Context<A, N, E, I>, Boolean>, Fn1<S, FoldContinue<N>>, Fn3<S, Acc, Context<A, N, E, I>, S>, S, Fn3<S, Acc, Context<A, N, E, I>, Acc>, Acc, G) - Method in class FoldG

Deprecated.

checkedApply(G, N, A) - Method in class BFPath

checkedApply(G, N, A) - Method in class DFPath

checkedApply(Monoid<W>, G, N, A) - Method in class Dijkstra

checkedApply(G, N, A) - Method in class Search

Context<A,N extends Node<A>,E extends Edge<A,N,E>,I extends Iterable<E>> - Interface in io.ataraxic.nomicflux.voyageur

A context surrounding a Node and it's outgoing and ingoing Edges

context(ValueNode<A, L>, HashSet<ValueEdge<A, L, W>>, HashSet<ValueEdge<A, L, W>>) - Static method in class ValueContext

Create a new Context

D

decompose() - Static method in class FoldContinue

decompose() - Method in interface Graph

Implementation-dependent and possibly non-deterministic decomposition of a graph into a Context and the rest of the graph

decompose() - Method in class AdjListGraph

Implementation-dependent and possibly non-deterministic decomposition of a graph into a Context and the rest of the graph

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 in io.ataraxic.nomicflux.voyageur.path

dfPath() - Static method in class DFPath

dfPath(G) - Static method in class DFPath

dfPath(G, N) - Static method in class DFPath

dfPath(G, N, A) - Static method in class DFPath

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 in io.ataraxic.nomicflux.voyageur.search

dfSearch() - Static method in class DFSearch

dfSearch(G) - Static method in class DFSearch

dfSearch(G, N) - Static method in class DFSearch

dfSearch(G, N, A) - Static method in class DFSearch

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>> - Class in io.ataraxic.nomicflux.voyageur.path

dijkstra() - Static method in class Dijkstra

dijkstra(Monoid<W>) - Static method in class Dijkstra

dijkstra(Monoid<W>, G) - Static method in class Dijkstra

dijkstra(Monoid<W>, G, N) - Static method in class Dijkstra

dijkstra(Monoid<W>, G, N, A) - Static method in class Dijkstra

E

Edge<A,N extends Node<A>,E extends Edge<A,N,E>> - Interface in io.ataraxic.nomicflux.voyageur

An edge from one Node to another

edgeFrom(ValueNode<A, L>) - Static method in class ValueEdge

edgeFromTo(ValueNode<A, L>, ValueNode<A, L>) - Static method in class ValueEdge

Create an edge from one node to another, with no weight information

edgeFromTo() - Static method in class ValueEdge

edgeTo(ValueNode<A, L>) - Static method in class ValueEdge

edgeToFrom(ValueNode<A, L>, ValueNode<A, L>) - Static method in class ValueEdge

Create an edge to one node from another, with no weight information

edgeToFrom() - Static method in class ValueEdge

emptyGraph() - Static method in class AdjListGraph

Create a new, empty AdjListGraph

endFold() - Static method in class FoldContinue

equals(Object) - Method in class ValueContext

equals(Object) - Method in class ValueEdge

equals(Object) - Method in class ValueNode

F

FoldContinue<N> - Class in io.ataraxic.nomicflux.voyageur.fold

Provide the next node in a fold, decompose a graph arbitrarily, or end the fold Isomorphic to Choice3<Unit, Unit, N>

FoldContinue() - Constructor for class FoldContinue

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> - Class in io.ataraxic.nomicflux.voyageur.fold

Deprecated.

FoldG() - Constructor for class FoldG

Deprecated.

foldG(Fn1<Context<A, N, E, I>, Boolean>, Fn1<S, FoldContinue<N>>, Fn3<S, Acc, Context<A, N, E, I>, S>, S, Fn3<S, Acc, Context<A, N, E, I>, Acc>, Acc, G) - Static method in class FoldG

Deprecated.

fromChain(Iterable<A>) - Static method in class AdjListGraph

Create an unlabeled, unweighted AdjListGraph using an iterable of node ID values

fromChains(Iterable<Iterable<A>>) - Static method in class AdjListGraph

Create an unlabeled, unweighted AdjListGraph from iterables of node ID values

fromEdge(ValueEdge<A, L, W>) - Static method in class AdjListGraph

Create an AdjListGraph with a single ValueEdge and the attached ValueNodes

fromEdges(Iterable<ValueEdge<A, L, W>>) - Static method in class AdjListGraph

Create an AdjListGraph from an iterable of ValueEdge

G

getInboundEdges() - Method in interface Context

getInboundEdges() - Method in class ValueContext

getLabel() - Method in class ValueNode

getLabel() - Method in interface LabeledNode

getNode() - Method in interface Context

getNode() - Method in class ValueContext

getNodeFrom() - Method in interface Edge

getNodeFrom() - Method in class ValueEdge

getNodeTo() - Method in interface Edge

getNodeTo() - Method in class ValueEdge

getOutboundEdges() - Method in interface Context

getOutboundEdges() - Method in class ValueContext

getValue() - Method in class ValueNode

getValue() - Method in interface Node

getWeight() - Method in class ValueEdge

getWeight() - Method in interface WeightedEdge

Graph<A,N extends Node<A>,E extends Edge<A,N,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>> - Interface in io.ataraxic.nomicflux.voyageur

Main interface for working with inductive graphs

guidedCutFold(Fn1<Context<A, N, E, I>, Boolean>, Fn1<S, FoldContinue<N>>, Fn3<S, Acc, Context<A, N, E, I>, S>, S, Fn3<S, Acc, Context<A, N, E, I>, Acc>, Acc, G) - Static method in class FoldG

Deprecated.

guidedCutFold(Fn1<Context<A, N, E, I>, Boolean>, State<S, FoldContinue<N>>, Fn2<Acc, Context<A, N, E, I>, State<S, Acc>>, S, Acc) - Method in interface Graph

Fold a graph into an accumulation, using stateful methods to guide the traversal of the graph, and a cutoff function to end the fold early

guidedFold(Fn1<S, FoldContinue<N>>, Fn3<S, Acc, Context<A, N, E, I>, S>, S, Fn3<S, Acc, Context<A, N, E, I>, Acc>, Acc, G) - Static method in class FoldG

Deprecated.

guidedFold(State<S, FoldContinue<N>>, Fn2<Acc, Context<A, N, E, I>, State<S, Acc>>, S, Acc) - Method in interface Graph

Fold a graph into an accumulation, using stateful methods to guide the traversal of the graph.

H

hashCode() - Method in class ValueContext

hashCode() - Method in class ValueEdge

hashCode() - Method in class ValueNode

I

io.ataraxic.nomicflux.voyageur - package io.ataraxic.nomicflux.voyageur

io.ataraxic.nomicflux.voyageur.fold - package io.ataraxic.nomicflux.voyageur.fold

io.ataraxic.nomicflux.voyageur.impl - package io.ataraxic.nomicflux.voyageur.impl

io.ataraxic.nomicflux.voyageur.path - package io.ataraxic.nomicflux.voyageur.path

io.ataraxic.nomicflux.voyageur.search - package io.ataraxic.nomicflux.voyageur.search

isEmpty() - Method in interface Graph

isEmpty() - Method in class AdjListGraph

L

labeledNode(A, L) - Static method in class ValueNode

Create a new node with a provided label

labeledNode(A) - Static method in class ValueNode

labeledNode() - Static method in class ValueNode

LabeledNode<A,L> - Interface in io.ataraxic.nomicflux.voyageur

A Node which also carries a label containing node metadata

labelNode(Node<A>, L) - Static method in class ValueNode

Label an existing node.

labelNode(Node<A>) - Static method in class ValueNode

labelNode() - Static method in class ValueNode

M

match(Fn1<? super Unit, ? extends R>, Fn1<? super Unit, ? extends R>, Fn1<? super N, ? extends R>) - Method in class FoldContinue

N

nextNode(N) - Static method in class FoldContinue

Provide the next node in a fold.

node(A) - Static method in class ValueNode

Create a new node with no label

node() - Static method in class ValueNode

Node<A> - Interface in io.ataraxic.nomicflux.voyageur

A Node containing a value, which serves as its (presumed unique) ID

nodeOrDecompose(Maybe<N>) - Static method in class FoldContinue

Provide the next node if available, otherwise decompose the graph arbitrarily.

nodeOrTerminate(Maybe<N>) - Static method in class FoldContinue

Provide the next node if available, otherwise terminate the fold.

R

removeEdge(E) - Method in interface Graph

removeEdge() - Method in interface Graph

removeEdge(ValueEdge<A, L, W>) - Method in class AdjListGraph

removeNode(N) - Method in interface Graph

removeNode() - Method in interface Graph

removeNode(ValueNode<A, L>) - Method in class AdjListGraph

S

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> - Class in io.ataraxic.nomicflux.voyageur.search

Search() - Constructor for class Search

simpleCutFold(Fn2<Acc, Context<A, N, E, I>, Acc>, Fn1<Context<A, N, E, I>, Boolean>, Acc, G) - Static method in class FoldG

Deprecated.

simpleCutFold(Fn1<Context<A, N, E, I>, Boolean>, Fn2<Acc, Context<A, N, E, I>, Acc>, Acc) - Method in interface Graph

Fold a graph into an accumulation, using the implementation's Graph.decompose() method, and a cutoff function to end the fold early

simpleFold(Fn2<Acc, Context<A, N, E, I>, Acc>, Acc, G) - Static method in class FoldG

Deprecated.

simpleFold(Fn2<Acc, Context<A, N, E, I>, Acc>, Acc) - Method in interface Graph

Fold a graph into an accumulation, using the implementation's Graph.decompose() method.

singletonGraph(ValueNode<A, L>) - Static method in class AdjListGraph

Create an AdjListGraph with a single ValueNode and no edges

swap() - Method in interface Edge

swap() - Method in class ValueEdge

T

toString() - Method in class ValueContext

toString() - Method in class ValueEdge

toString() - Method in class ValueNode

V

ValueContext<A,L,W> - Class in io.ataraxic.nomicflux.voyageur.impl

A Context which is a value object, isomorphic to a tuple containing its node, a set of edges into the node, and a set of edges coming out of the node

ValueEdge<A,L,W> - Class in io.ataraxic.nomicflux.voyageur.impl

A WeightedEdge which is a value object, isomorphic to the two ValueNodes it connects and its weight.

ValueNode<A,L> - Class in io.ataraxic.nomicflux.voyageur.impl

A LabeledNode which is a value object, isomorphic to its value and label

W

WeightedEdge<A,N extends Node<A>,W,E extends WeightedEdge<A,N,W,E>> - Interface in io.ataraxic.nomicflux.voyageur

An Edge with additional weight metadata

weightedEdgeFrom(ValueNode<A, L>) - Static method in class ValueEdge

Curried function creating an edge from a given node

weightedEdgeFromTo(ValueNode<A, L>, ValueNode<A, L>, W) - Static method in class ValueEdge

Create an edge from one node to another with weight metadata

weightedEdgeFromTo(ValueNode<A, L>, ValueNode<A, L>) - Static method in class ValueEdge

weightedEdgeFromTo() - Static method in class ValueEdge

weightedEdgeTo(ValueNode<A, L>) - Static method in class ValueEdge

Curried function creating an edge to a given node

weightedEdgeToFrom(ValueNode<A, L>, ValueNode<A, L>, W) - Static method in class ValueEdge

Create an edge to one node from another with weight metadata

weightedEdgeToFrom(ValueNode<A, L>, ValueNode<A, L>) - Static method in class ValueEdge

weightedEdgeToFrom() - Static method in class ValueEdge

A B C D E F G H I L M N R S T V W