Package agl2

Adaptive Graph Library

See:
Description

Interface Summary

BidirectedEdgeRep	The BidirectedEdgeRep description.
BidirectedEdgeVertex	The BidirectedEdgeVertex description.
BidirectedGraph	The BidirectedGraph description.
DirectedEdge	The DirectedEdge description.
DirectedEdgeRep	The DirectedEdgeRep description.
DirectedEdgeVertex	The DirectedEdgeVertex description.
DirectedGraph	The DirectedGraph description.
Edge	The Edge connects two vertices in a graph.
EdgeGraph	The EdgeGraph description.
EdgeRep	The EdgeRep description.
EdgeVertex	The EdgeVertex is a vertex that contains it's own edge information.
Graph	The Graph
GraphListener	The GraphListener description.
GraphMap	The GraphMap description.
GraphTag	The GraphTag description.
GraphVisitor	The GraphVisitor description.
HyperEdge	The HyperEdge description.
MultiEdgeGraph	The MultiEdgeGraph description.
MutableGraph	The MutableGraph description.
Path	The Path abstracts a set of nodes and edges of a graph representing a connected path.
PropertyGraph	The PropertyGraph interface for graphs that support interfaces.
UndirectedEdgeRep	The UndirectedEdgeRep is an interface tag.
UndirectedGraph	The UndirectedGraph is an interface tag
Vertex	The Vertex is an interface tag.
VertexGraph	The VertexGraph description.

Class Summary

AbstractGraph	The AbstractGraph description.
AbstractGraphMap	The AbstractGraphMap description.
Bigraph	The Bigraph description.
BigraphBuilder	The BigraphBuilder description.
Digraph	A digraph (or a directed graph) is a graph in which the edges are directed.
DigraphBuilder	The DigraphBuilder description.
DirectedEdgeImpl	The DirectedEdgeImpl description.
DirectedPath	The DirectedPath description.
EdgeImpl	The EdgeImpl description.
GraphBuilder	The GraphBuilder builds a representation of a graph.
GraphEvent	The GraphEvent description.
GraphEventMulticast	The GraphEventMulticast description.
GraphProperties	Every graph provides has set of properties.
Graphs	The Graphs a collections of graph routine
GraphTag.MapTag
GraphTag.Tag	In order to make tags unique, we need to force them to through a factory method.
RepSolver	The RepSolver finds the best representations for some set or constraints.
UndirectedGraphImpl	The UndirectedGraphImpl description.
Ungraph	The Ungraph an UndirectedGraph
UngraphBuilder	The UngraphBuilder description.

Exception Summary

GraphException

The GraphException description.

Package agl2 Description

Adaptive Graph Library

Concepts

Reps

Understand Edges and vertices export vertex and edge type (with containers) export set of tags and natural maps

Properties

Tags and maps for graph structures. Many property maps are predefined by the representations. EDGE_DATA in Matrix Rep will provide a map like interface to the matrix. While for other rep will be simply implemented as a HashMap of Edge to Object. /

Graph

Reference to Reps and tags/properties Provide abstraction layer that hides Reps and defines allowed operations (in terms of properties)

Builders

Reference to Graph (with access to rep and properties). Allowed to construct and remove edges/nodes. Chooses best rep for graph based on grap tags.

Algorithms

Algoirthms will operate on different types of graphs. Suggest/Require graph tags for efficient run. Decorate graph with extra tags.

Listeners

Listeners are used during graph building events. Example : VERTEX_DATA property maintenence is done through a graph listeners.

Internally these are used to maintain the maps. Users may create and add their own listeners.