de.fhstralsund.vinets.structure
Interface Node

All Superinterfaces:
java.lang.Cloneable, NetElement, java.io.Serializable
All Known Subinterfaces:
Block, Port
All Known Implementing Classes:
SimpleGraph.SimpleNode

public interface Node
extends NetElement

A Node object models a Node of a Graph or HyperGraph. It provides access to all properties that a Node may have. In a hierarchical Graph, the interface reveals the view on a Node from outside. Normally, a class which implements this interface has no public constructor, but its instances are created by a factory method of the corresponding Graph class.


Method Summary
 int degree()
          Delivers the number of undirected edges incident to this Node.
 NodeType getNodeType()
          Delivers the Type of this Node.
 java.util.Iterator inArcs()
          Delivers an Iterator to traverse all incoming arcs of this Node.
 java.util.Iterator incidentEdges()
          Delivers an Iterator to traverse all incident edges of this Node.
 int indegree()
          Delivers the number of incoming arcs of this Node.
 boolean isAtomar()
          Indicates whether this Node is atomar, i.e. does not contain any inner graph hierarchically.
 java.util.Iterator outArcs()
          Delivers an Iterator to traverse all outgoing arcs of this Node.
 int outdegree()
          Delivers the number of outgoing arcs of this Node.
 java.util.Iterator undirectedEdges()
          Delivers an Iterator to traverse all undirected edges incident to this Node.
 
Methods inherited from interface de.fhstralsund.vinets.structure.NetElement
clearLabels, containsLabel, getBooleanLabel, getData, getDoubleLabel, getGeometry, getHost, getID, getIntLabel, getLabel, getLabelKeySet, getName, getOriginal, getRepresentation, removeLabel, setBooleanLabel, setData, setDoubleLabel, setGeometry, setIntLabel, setLabel, setName, setRepresentation
 

Method Detail

isAtomar

boolean isAtomar()
Indicates whether this Node is atomar, i.e. does not contain any inner graph hierarchically.

Returns:
true if the node does not contain an inner Graph.

outdegree

int outdegree()
Delivers the number of outgoing arcs of this Node.

Returns:
the number of outgoing Links of this Node.

indegree

int indegree()
Delivers the number of incoming arcs of this Node.

Returns:
the number of incoming Links of this Node.

degree

int degree()
Delivers the number of undirected edges incident to this Node.

Returns:
the number of undirected Links incident to this Node.

outArcs

java.util.Iterator outArcs()
Delivers an Iterator to traverse all outgoing arcs of this Node.

Returns:
an Iterator to traverse all outgoing Links of this Node.

inArcs

java.util.Iterator inArcs()
Delivers an Iterator to traverse all incoming arcs of this Node.

Returns:
an Iterator to traverse all incoming Links of this Node.

undirectedEdges

java.util.Iterator undirectedEdges()
Delivers an Iterator to traverse all undirected edges incident to this Node.

Returns:
an Iterator to traverse all undirected Links of this Node.

incidentEdges

java.util.Iterator incidentEdges()
Delivers an Iterator to traverse all incident edges of this Node. All Links are delivered - directed (incoming and outgoing) arcs and undirected edges.

Returns:
an Iterator to traverse all incident Links of this Node.

getNodeType

NodeType getNodeType()
Delivers the Type of this Node.

Returns:
the Type of this Node