All Classes and Interfaces

Class	Description
BasicGraphEdge<N>	Base and naive implementation of graph edge.
BasicGraphHeavyNode<E>	Default implementation of GraphHeavyNode.
BasicHeavyGraph<N extends BasicGraphHeavyNode<E>,E extends BasicGraphEdge<N>>	Basic and naive graph implementation.
BasicLightGraph<N,E extends GraphEdge<N>>	Basic and naive graph implementation using light nodes.
BasicLightGraph.CollectionKind
BasicSuperLightGraph<N>
BasicTree<N extends BasicTreeNode<N>>
BasicTreeNode<N extends BasicTreeNode<N>>
BijectionGenerator
ExplicitSubGraph<N,E>	Base class use to construct subgraphs by explicitly defining their content.
ExtensionSubGraph<N,E>	Explicit subgraph defined by extension.
FilteredSubGraph<N,E>	Graph built from an underlying graph, by applying filters to nodes and edges.
GraphEdgeIngoingPredicate<N>	Edge predicate for ingoing edges of a node.
GraphEdgeOutgoingPredicate<N>	Edge predicate for outgoing edges of a node.
GraphFilter<N,E>	Base class used to filter a graph and make it appear as another graph.
GraphPrinter	Utility class used to print a graph as text.
ImplicitSubGraph<N,E>	Base implementation of implicit subgraph.
InvertedGraph<N,E>	Create an inverted view of a Graph.
RandomGraphGenerator
RestrictionSubGraph<N,E>	Explicit subgraph defined by restriction.
TestEdge<N extends TestNode>
TestGraph<N extends TestNode,E extends TestEdge<N>>
TestGraphHeavyEdge	Implementation of graph edge for tests.
TestGraphHeavyNode	Implementation of graph heavy node for tests.
TestGraphLightEdge	Implementation of graph light edge for tests.
TestGraphLightNode	Implementation of graph node for tests.
TestHeavyGraph	Heavy Graph implementation used for tests.
TestLightGraph
TestNode	Interface of node used for tests.
TestTree
TestTreeNode	Implementation of TreeNode for tests.
TreeAsGraph<N>	Graph adapter implementation over a TreeAdapter.