Package com.amalgamasimulation.graph

package com.amalgamasimulation.graph

Class	Description
Algorithm	This interface consists exclusively of static methods that operate on graphs.
Algorithm.ArcRelativeDirection	Enumeration used to differentiate arcs when traversing a graph
Algorithm.GraphTraversalContextCalculator<A,B,C>	Functional interface for a function answering the question "What must be the context of the node being added considering we know the added arc, the added node itself, and the context of the already traversed node adjacent to this arc?"
Algorithm.GraphTraversalEndPredicate<A,B,C>	Functional interface for a predicate answering the question "Must we end the traversal after we added the specific arc, node and calculated the specific node context?"
Algorithm.GraphTraversalPredicate<A,B>	Functional interface for a predicate answering the question "Can we traverse the arc and the node adjacent to this arc?"
Graph<N,A>	Represents an oriented graph with instances of NodeValueType in nodes and instances of ArcValueType in arcs.
GraphPath<N,A>	Represents a path in a graph.