All Classes

Interface Summary

Class	Description
IGraph<N>	A graph in which the nodes are labeled.
IGraphGenerator<N,A>	A graph can be implicitly represented by a (set of) source node(s), called the root(s), and a function that generates the successor nodes for any given node.
IKVFilter	A filter transforms a given object into another one.
IKVStore	Generic interface of KVStores allowing convenient access to the data contained.
ILabeledGraph<N,A>	Graphs of this type also assign a label to the edges
ILabeledPath<N,A>	Same as IPath only that the edges can have labels.
ILazySuccessorGenerator<N,A>	Lazy successor generators are able to produce successor nodes step by step.
INewNodeDescription<N,A>	Describes a new node and the edge to it that are to be added to an explicit graph model.
IPath<N>	A path is a kind of list for items of some node type N.
IRootGenerator<N>	Creates the root node(s) for a graph.
ISingleRootGenerator<N>	This is a root generator for implicit graphs with just one source.
ISuccessorGenerator<N,A>	Creates the descriptions of successor nodes and the edges to them.