Package org.bigraphs.framework.core
Class AbstractRankedGraph.LabeledNode
java.lang.Object
org.bigraphs.framework.core.AbstractRankedGraph.LabeledNode
- Enclosing class:
- AbstractRankedGraph<B extends Bigraph<?>,
N, E>
Represents the two types of nodes of a ranked graph: place nodes and link nodes.
The method
isPlaceNode()
can be called to determine the type.
It is automatically inferred by checking whether the supplied control is null
.-
Constructor Summary
ConstructorDescriptionLabeledNode
(String id, BigraphEntityType type) LabeledNode
(String id, BigraphEntityType type, Control control) -
Method Summary
Modifier and TypeMethodDescriptiongetId()
Gets the label associated with this node.getType()
boolean
boolean
Symmetric method toisPlaceNode()
.boolean
boolean
boolean
toString()
-
Constructor Details
-
LabeledNode
-
LabeledNode
-
-
Method Details
-
getId
Gets the label associated with this node.- Returns:
- edge label
-
getControl
-
isPlaceNode
public boolean isPlaceNode()- Returns:
true
, if the node is a place node, otherwise it is a link node
-
isLinkNode
public boolean isLinkNode()Symmetric method toisPlaceNode()
.- Returns:
true
, if the node is a link node, otherwise it is a place node
-
isInterfaceNode
public boolean isInterfaceNode()- Returns:
true
, if the node is a root, site, outer name or inner name
-
isVariableNode
public boolean isVariableNode() -
isRootNode
public boolean isRootNode() -
getType
-
toString
-