|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface KNode
A representation of the model object 'Node'. All nodes except exactly one node must have an assigned parent node. The node without parent is the top node of the graph and represents the graph itself. Each node must be assigned a label.
The parent-child relationship of nodes can be used to describe hierarchy in nested graphs.
The following features are supported:
KGraphPackage.getKNode()
Method Summary | |
---|---|
EList<KNode> |
getChildren()
Returns the value of the 'Children' containment reference list. |
EList<KEdge> |
getIncomingEdges()
Returns the value of the 'Incoming Edges' reference list. |
EList<KEdge> |
getOutgoingEdges()
Returns the value of the 'Outgoing Edges' containment reference list. |
KNode |
getParent()
Returns the value of the 'Parent' container reference. |
EList<KPort> |
getPorts()
Returns the value of the 'Ports' containment reference list. |
void |
setParent(KNode value)
Sets the value of the ' Parent ' container reference. |
Methods inherited from interface de.cau.cs.kieler.core.kgraph.KLabeledGraphElement |
---|
getLabels |
Methods inherited from interface de.cau.cs.kieler.core.kgraph.KGraphElement |
---|
getData, getData, getData |
Methods inherited from interface org.eclipse.emf.ecore.EObject |
---|
eAllContents, eClass, eContainer, eContainingFeature, eContainmentFeature, eContents, eCrossReferences, eGet, eGet, eInvoke, eIsProxy, eIsSet, eResource, eSet, eUnset |
Methods inherited from interface org.eclipse.emf.common.notify.Notifier |
---|
eAdapters, eDeliver, eNotify, eSetDeliver |
Method Detail |
---|
EList<KNode> getChildren()
KNode
.
It is bidirectional and its opposite is 'Parent
'.
The children together with their edges form a sub-graph that is contained
in this parent node.
KGraphPackage.getKNode_Children()
,
getParent()
opposite | = | parent |
containment | = | true |
KNode getParent()
Children
'.
The parent node must be null
if and only if this is the top node of
the graph structure.
setParent(KNode)
,
KGraphPackage.getKNode_Parent()
,
getChildren()
opposite | = | children |
transient | = | false |
void setParent(KNode value)
Parent
' container reference.
This automatically adds the node to the parent's list of children.
value
- the new value of the 'Parent' container reference.getParent()
EList<KPort> getPorts()
KPort
.
It is bidirectional and its opposite is 'Node
'.
Each node may have an arbitrary number of ports. Edges may or may not be
connected to ports.
KGraphPackage.getKNode_Ports()
,
KPort.getNode()
opposite | = | node |
containment | = | true |
EList<KEdge> getOutgoingEdges()
KEdge
.
It is bidirectional and its opposite is 'Source
'.
KGraphPackage.getKNode_OutgoingEdges()
,
KEdge.getSource()
opposite | = | source |
containment | = | true |
EList<KEdge> getIncomingEdges()
KEdge
.
It is bidirectional and its opposite is 'Target
'.
KGraphPackage.getKNode_IncomingEdges()
,
KEdge.getTarget()
opposite | = | target |
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |