agl2
Class AbstractGraph

java.lang.Object
  |
  +--agl2.AbstractGraph
All Implemented Interfaces:
Graph, GraphTag, java.io.Serializable
Direct Known Subclasses:
Digraph, Ungraph

public class AbstractGraph
extends java.lang.Object
implements Graph, GraphTag, java.io.Serializable

The AbstractGraph description.

See Also:
Serialized Form

Nested Class Summary
 
Nested classes inherited from class agl2.GraphTag
GraphTag.MapTag, GraphTag.Tag
 
Field Summary
protected  GraphProperties properties
           
protected  EdgeRep rep
           
 
Fields inherited from interface agl2.GraphTag
allTags, BIGRAPH, DIGRAPH, EDGE_DATA, EDGE_INDEX, EDGE_WEIGHT, GRAPH_ACYLIC, GRAPH_NAME, GRAPH_ROOT, GRAPH_TRAITS, MULTIGRAPH, OBJECT_VERTEX, UNGRAPH, VERTEX_COLOR, VERTEX_DATA, VERTEX_DISTANCE, VERTEX_EDGEMAP, VERTEX_INDEX
 
Constructor Summary
AbstractGraph()
           
AbstractGraph(EdgeRep r, GraphProperties p)
           
 
Method Summary
 Edge getEdge(java.lang.Object o1, java.lang.Object o2)
          Find an edge between nodes.
 java.util.Set getEdges()
           
 java.lang.Object getProperty(GraphTag mapTag, java.lang.Object VorE)
           
 java.util.Set getVertices()
           
 boolean hasEdge(java.lang.Object v1, java.lang.Object v2)
           
 boolean hasVertex(java.lang.Object o)
           
protected  java.lang.Object objectVertex(java.lang.Object o)
          Given an object return the vertex of the graph.
 java.lang.String properties()
           
 void putProperty(GraphTag mapTag, java.lang.Object VorE, java.lang.Object value)
           
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Field Detail

rep

protected EdgeRep rep

properties

protected GraphProperties properties
Constructor Detail

AbstractGraph

public AbstractGraph()

AbstractGraph

public AbstractGraph(EdgeRep r,
                     GraphProperties p)
Method Detail

objectVertex

protected java.lang.Object objectVertex(java.lang.Object o)
Given an object return the vertex of the graph. For graphs that support object-as-vertices or if passed a Vertex Type it returns the argument. Otherwise it uses an object -> vertex map to find the internal vertex.


getVertices

public java.util.Set getVertices()
Specified by:
getVertices in interface Graph
Returns:
Set v in V

getEdges

public java.util.Set getEdges()
Specified by:
getEdges in interface Graph
Returns:
Set e in E

getEdge

public Edge getEdge(java.lang.Object o1,
                    java.lang.Object o2)
Find an edge between nodes. @see multigraph if the graph supports multiple edges between nodes.


hasEdge

public boolean hasEdge(java.lang.Object v1,
                       java.lang.Object v2)

hasVertex

public boolean hasVertex(java.lang.Object o)

putProperty

public void putProperty(GraphTag mapTag,
                        java.lang.Object VorE,
                        java.lang.Object value)

getProperty

public java.lang.Object getProperty(GraphTag mapTag,
                                    java.lang.Object VorE)

properties

public java.lang.String properties()