Class AbstractRankedGraph.LabeledNode

java.lang.Object
org.bigraphs.framework.core.AbstractRankedGraph.LabeledNode
Enclosing class:
AbstractRankedGraph<B extends Bigraph<?>,N,E>

public static class AbstractRankedGraph.LabeledNode extends Object
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 Details

  • Method Details

    • getId

      public String getId()
      Gets the label associated with this node.
      Returns:
      edge label
    • getControl

      public Control 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 to isPlaceNode().
      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

      public BigraphEntityType getType()
    • toString

      public String toString()
      Overrides:
      toString in class Object