

PREV CLASS NEXT CLASS  FRAMES NO FRAMES  
SUMMARY: NESTED  FIELD  CONSTR  METHOD  DETAIL: FIELD  CONSTR  METHOD 
java.lang.Object  +org.quilt.graph.Directed
A graph consisting of vertices connected by directed, weighted edges. The graph is guaranteed to have at least an entry and an exit point and to always be wellformed, in the sense that
Field Summary  
protected static int 
graphIndex
Index of most recently built graph. 
Constructor Summary  

Directed()
Builds a root directed graph with two vertices and two edges. 
protected 
Directed(Directed parent)
Subgraph constructor; will have depth one more than parent. 
Method Summary  
int 
anotherEdge(Edge e)
Step edge count. 
int 
anotherVertex(Vertex v)
Step count of vertices . 
static void 
checkForNull(java.lang.Object o,
java.lang.String what)

Entry 
closestEntry(Directed g)
If the edge points towards a vertex in a graph which is enclosed within the current graph, return a reference to the closest Entry. 
protected static Directed 
connectSubgraph(Directed subgraph,
Edge e,
int n)
Inserts a subgraph into an edge, putting the entry and exit points on the edge presented. 
int 
getDepth()

Entry 
getEntry()

Exit 
getExit()

int 
getIndex()

Directed 
getParent()

Vertex 
insertVertex(Edge e)
Create a new Vertex with a Unary connector and insert into this graph's edge e. 
protected Vertex 
insertVertex(Vertex v,
Edge e)
Insert a (new) Vertex into the graph along the edge provided. 
int 
size()

Directed 
subgraph(Edge e,
int n)
Constructs a subgraph and inserts it into the parent graph on the edge presented. 
Methods inherited from class java.lang.Object 
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait 
Field Detail 
protected static int graphIndex
Constructor Detail 
public Directed()
Connector
,
Edge
protected Directed(Directed parent)
parent
 Graph in which this is a subgraph.Method Detail 
public Directed getParent()
public int getIndex()
protected static final Directed connectSubgraph(Directed subgraph, Edge e, int n)
e
 An edge in the parent graph.
public Directed subgraph(Edge e, int n)
e
 An edge in the parent graph.
public int getDepth()
public Entry getEntry()
public Exit getExit()
public static void checkForNull(java.lang.Object o, java.lang.String what)
public int anotherEdge(Edge e)
e
 Edge being added. Ignored at the moment.public int anotherVertex(Vertex v)
v
 Vertex being added. Being ignored at the moment.protected final Vertex insertVertex(Vertex v, Edge e)
v
 Vertex to be inserted.e
 Edge it is to be inserted along.public Vertex insertVertex(Edge e)
public int size()
public Entry closestEntry(Directed g)
g
 Candidate lowerlevel graph.


PREV CLASS NEXT CLASS  FRAMES NO FRAMES  
SUMMARY: NESTED  FIELD  CONSTR  METHOD  DETAIL: FIELD  CONSTR  METHOD 