| BasicGraphEdge<N> |
Base and naive implementation of graph edge.
|
| BasicGraphHeavyNode<E> |
|
| 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.
|
| BasicSuperLightGraph<N> |
|
| BasicTree<N extends BasicTreeNode<N>> |
|
| BasicTreeNode<N extends BasicTreeNode<N>> |
|
| 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.
|
| RestrictionSubGraph<N,E> |
Explicit subgraph defined by restriction.
|
| TreeAsGraph<N> |
Graph adapter implementation over a TreeAdapter.
|