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

Packages that use AdjListGraph

Package	Description
io.ataraxic.nomicflux.voyageur.impl

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

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

Modifier and Type	Method and Description
AdjListGraph<A,L,W>	AdjListGraph.addEdge(ValueEdge<A,L,W> edge)
AdjListGraph<A,L,W>	AdjListGraph.addNode(ValueNode<A,L> node)
static <A,L,W> AdjListGraph<A,L,W>	AdjListGraph.emptyGraph() Create a new, empty AdjListGraph
static <A> AdjListGraph<A,Unit,Unit>	AdjListGraph.fromChain(Iterable<A> values) Create an unlabeled, unweighted AdjListGraph using an iterable of node ID values
static <A> AdjListGraph<A,Unit,Unit>	AdjListGraph.fromChains(Iterable<Iterable<A>> values) Create an unlabeled, unweighted AdjListGraph from iterables of node ID values
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
static <A,L,W> AdjListGraph<A,L,W>	AdjListGraph.fromEdges(Iterable<ValueEdge<A,L,W>> edges) Create an AdjListGraph from an iterable of ValueEdge
AdjListGraph<A,L,W>	AdjListGraph.removeEdge(ValueEdge<A,L,W> edge)
AdjListGraph<A,L,W>	AdjListGraph.removeNode(ValueNode<A,L> node)
static <A,L,W> AdjListGraph<A,L,W>	AdjListGraph.singletonGraph(ValueNode<A,L> a) Create an AdjListGraph with a single ValueNode and no edges

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

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