

PREV PACKAGE NEXT PACKAGE  FRAMES NO FRAMES 
int
coded, directed edges.
See:
Description
Interface Summary  

Connector<N,P>  A Connector is used to specify a connection of a new node
with a graph at a position which is given by an existing node in
the graph. 
Operator<N> 
Class Summary  

CompiletimeModel  
ConnectionTransformation  
EdgeData  
EdgeIterator  An EdgeIterator is used to iterate over the edges
of a node. 
FieldListPattern  
Graph  This class is an abstract base class for implementations of XL's runtime model for graphlike structures. 
Graph.ThreadData  
GraphImpl  
GraphQueue  
GraphQueue.AddEdgeDescriptor  
GraphQueue.AddNodeDescriptor  
GraphQueue.AddUndirectedEdgeDescriptor  
GraphQueue.ConnectDescriptor  
GraphQueue.DeleteEdgeDescriptor  
GraphQueue.DeleteNodeDescriptor  
GraphQueue.ExecuteDescriptor  
GraphQueueImpl  
Neighbors<N>  
NodeEdgePair<N>  
Producer  This class is an abstract base implementation of Producer . 
RuntimeModel 
Abstract base implementation of XL's compiletime and runtime models for
graphs with objects as nodes and int
coded, directed edges.
CompiletimeModel
and
RuntimeModel
. These classes are suitable for
data sources that can be represented as graphs with objects
as nodes and int
coded, directed edges:
CompiletimeModel.getNodeType()
and RuntimeModel.getNodeType()
.
int
value. This int
value is interpreted
as a set of subedges in the following way:
RuntimeModel.SPECIAL_MASK
)
represent the edge's special subedge. If these bits, interpreted as a byte,
have the value 0, no special subedge is present. Otherwise, the special subedge
identified by this byte is present in this edge. Because the value 255 (all bits set)
is used as a wildcard mask in pattern matching, that value should not be used
as a special subedge identifier. Note that at most one special edge
may exist at a time between the nodes of an ordered tuple.
RuntimeModel.BRANCH_EDGE
and
RuntimeModel.SUCCESSOR_EDGE
. Implementations may define
further types of subedges by further bit masks. Thus, at most
24 different standard subedges may exist independently between the nodes
of an ordered tuple.


PREV PACKAGE NEXT PACKAGE  FRAMES NO FRAMES 