

PREV CLASS NEXT CLASS  FRAMES NO FRAMES  
SUMMARY: NESTED  FIELD  CONSTR  METHOD  DETAIL: FIELD  CONSTR  METHOD 
public interface Node
Provides an interfaces for a graph node. All directed edges whose source is
the current Node
are regarded as outgoing edges. Ingoing edges
are those directed edges whose target is the current Node
.
Undirected edges are regarded separately since a Graph
can have
both directed and indirected edges.
Edge
,
GraphElement
,
Graph
Method Summary  

Collection<Edge> 
getAllInEdges()
Union of getDirectedInEdges() and
getUndirectedEdges() . 
Collection<Node> 
getAllInNeighbors()
Union of getInNeighbors() and
getUndirectedNeighbors() . 
Collection<Edge> 
getAllOutEdges()
Union of getDirectedOutEdges() and
getUndirectedEdges() . 
Collection<Node> 
getAllOutNeighbors()
Union of getOutNeighbors() and
getUndirectedNeighbors() . 
Collection<Edge> 
getDirectedInEdges()
Returns a collection containing the directed ingoing edges of the Node . 
Iterator<Edge> 
getDirectedInEdgesIterator()
Returns an iterator containing the directed ingoing edges of the Node . 
Collection<Edge> 
getDirectedOutEdges()
Returns a collection containing the outgoing directed edges of the Node . 
Iterator<Edge> 
getDirectedOutEdgesIterator()
Returns an iterator containing the outgoing directed edges of the Node . 
Collection<Edge> 
getEdges()
Returns a collection containing all the ingoing and outgoing directed and undirected edges of the current Node . 
Iterator<Edge> 
getEdgesIterator()
Returns an iterator containing all the ingoing and outgoing directed and undirected edges of the current Node . 
int 
getInDegree()
Returns the indegree of the current Node . 
Collection<Node> 
getInNeighbors()
Returns a collection containing the neighbor nodes belonging to incoming edges. 
Iterator<Node> 
getInNeighborsIterator()
Returns an iterator over the neighbor nodes belonging to incoming edges. 
Collection<Node> 
getNeighbors()
Returns a collection containing all the neighbor nodes of the current Node . 
Iterator<Node> 
getNeighborsIterator()
Returns an interator over the neighbor nodes of the current Node . 
int 
getOutDegree()
Returns the outdegree of the current Node . 
Collection<Node> 
getOutNeighbors()
Returns a collection containing all the neighbors of the current Node which are connected by an outgoing Edge . 
Iterator<Node> 
getOutNeighborsIterator()
Returns an iterator containing all the neighbors of the current Node which are connected by an outgoing Edge . 
Collection<Edge> 
getUndirectedEdges()
Returns a collection containing the undirected ingoing and outgoing edges of the Node . 
Iterator<Edge> 
getUndirectedEdgesIterator()
Returns an iterator containing all undirected edges of the Node . 
Collection<Node> 
getUndirectedNeighbors()
Returns a collection containing all the neighbors which are connected to the current Node by an undirected Edge . 
Methods inherited from interface org.graffiti.graph.GraphElement 

getGraph, remove 
Methods inherited from interface org.graffiti.attributes.Attributable 

addAttribute, addBoolean, addByte, addDouble, addFloat, addInteger, addLong, addShort, addString, changeBoolean, changeByte, changeDouble, changeFloat, changeInteger, changeLong, changeShort, changeString, containsAttribute, getAttribute, getAttributes, getBoolean, getByte, getDouble, getFloat, getInteger, getListenerManager, getLong, getShort, getString, removeAttribute, setBoolean, setByte, setDouble, setFloat, setInteger, setLong, setShort, setString 
Method Detail 

Collection<Edge> getAllInEdges()
getDirectedInEdges()
and
getUndirectedEdges()
.
Collection<Node> getAllInNeighbors()
getInNeighbors()
and
getUndirectedNeighbors()
.
Collection<Edge> getAllOutEdges()
getDirectedOutEdges()
and
getUndirectedEdges()
.
Collection<Node> getAllOutNeighbors()
getOutNeighbors()
and
getUndirectedNeighbors()
.
Collection<Edge> getDirectedInEdges()
Node
.
Node
.Iterator<Edge> getDirectedInEdgesIterator()
Node
.
Node
.Collection<Edge> getDirectedOutEdges()
Node
.
Node
.Iterator<Edge> getDirectedOutEdgesIterator()
Node
.
Node
.Collection<Edge> getEdges()
Node
. Ingoing and outgoing
edges will not be separated and there will be no ordering on the
collection.
Node
.Iterator<Edge> getEdgesIterator()
Node
. Ingoing and outgoing
edges will not be separated and there will be no ordering on the
collection.
Node
.int getInDegree()
Node
. The indegree is
defined as the number of ingoing, directed edges plus the number of
undirected edges.
Node
.Collection<Node> getInNeighbors()
getInDegree()
, due to
the fact that multiple edges between the same two nodes are possible but
the corresponding Node
is only inserted once.
Iterator<Node> getInNeighborsIterator()
Collection<Node> getNeighbors()
Node
. A neighbor Node
is either the source or
the target of either an ingoing or an outgoing or an undirected
Edge
.
Node
.Iterator<Node> getNeighborsIterator()
Node
. A neighbor Node
is either the source or
the target of either an ingoing or outgoing or undirected
Edge
.
Node
.int getOutDegree()
Node
. The outdegree
is defined as the number of outgoing, directed edges plus the number of
undirected edges.
Node
.Collection<Node> getOutNeighbors()
Node
which are connected by an outgoing Edge
.
Note that the number of elements returned by this function might be less
than the number returned by getOutDegree()
, due to the fact
that multiple edges between the same two nodes are possible but the
corresponding Node
is only inserted once.
Node
connected by an outgoing Edge
.Iterator<Node> getOutNeighborsIterator()
Node
which are connected by an outgoing Edge
.
Node
s of the
current Node
connected by an outgoing
Edge
.Collection<Edge> getUndirectedEdges()
Node
.
Node
.Iterator<Edge> getUndirectedEdgesIterator()
Node
.
Node
.Collection<Node> getUndirectedNeighbors()
Node
by an undirected Edge
.
Node
by an undirected Edge
.


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