Method Summary
All Methods Instance Methods Abstract Methods
void
Adds the given graph-node to the internal list of registered graphnodes.
boolean
Checks, whether the given graph is entirely contained in this graph.
boolean
Checks, whether the given graph is entirely contained in this graph.
Returns the graph node whose id is equal to the given node from the internal list of
graphnodes.
Returns the graph edge with the specified id.
Returns the complete list of graphedges contained in the graph
Returns the graphnode with the given id from the internal list of graphnodes.
Returns the complete list of graph nodes registered in the graph.
Returns a list of graph nodes registered in the graph.
Returns the ID-manager for this graph.
int
int
Returns the graph node that is identical (due to its similarity value of 1.0) to the given node
from the internal list of graphnodes.
Returns the graph node that is identical (due to its similarity value of 1.0) to the given node
from the internal list of graphnodes.
Returns the default visualizer for this graph.
boolean
Removes the given graph-node from the internal list of registered graphnodes.
void
Updates the internal list of registered graphnodes, when an id of a graph node changed.
Methods inherited from interface de.uni_trier.wi2.procake.data.object.DataObject
assertSameValueAsIn , copy , getDataClass , getId , getModel , hasClassName , hasSameValueAsIn , hasSystemClassName , isAggregate , isAtomic , isBoolean , isByteArray , isChronologic , isCollection , isDataflowWrapper , isDataReference , isDate , isDouble , isInteger , isInterval , isKindOf , isList , isMemberOf , isNESTConstraintEdge , isNESTControlflowEdge , isNESTControlflowNode , isNESTDataflowEdge , isNESTDataNode , isNESTEdge , isNESTGraph , isNESTNode , isNESTPartOfEdge , isNESTSequenceNode , isNESTSequentialWorkflow , isNESTSubWorkflowNode , isNESTTaskNode , isNESTWorkflow , isNESTWorkflowNode , isNode , isNumeric , isSequence , isSet , isString , isSubWorkflow , isTask , isTime , isTimestamp , isUnion , isURI , isVoid , isWorkflow , removeId , setDataClass , setId , toDetailedString , toXML
Methods inherited from interface de.uni_trier.wi2.procake.data.PropertyHandler
addProperty , addProperty , getAllProperties , getAllPropertyNodes , getProperty , getPropertyNames , getPropertyNode , getPropertyRootNode , hasProperties , removeProperty , setPropertyRootNode
Method Details
addGraphNode
Adds the given graph-node to the internal list of registered graphnodes. Nodes are being bound
automatically if they are connected to already bound edges. → Create the graph based on
the startnode, so that all nodes/edges get automatically bound.
Parameters:
newGraphNode
- The graphnode, which should be registered.
removeGraphNode
boolean removeGraphNode (String id)
Removes the given graph-node from the internal list of registered graphnodes. It is important
to remove unused or obsolete nodes from the internal list in order to have a consistent
objectmodel.
Parameters:
id
- The id of the node to remove.
Returns:
TRUE, if the removal-process was successfull. FALSE, otherwise.
getSemanticallyEqualNode
Returns the graph node that is identical (due to its similarity value of 1.0) to the given node
from the internal list of graphnodes.
Parameters:
node
- the node that is compared to the other nodes of the graph
simVal
- The similarity valuator to use
simMeasure
- The name of the similarity measure to use
Returns:
semantic equal graph node, if exists null
otherwise
getSemanticallyEqualNode
Returns the graph node that is identical (due to its similarity value of 1.0) to the given node
from the internal list of graphnodes. The default similarity valuator and measure are used.
Parameters:
node
- the node that is compared to the other nodes of the graph
Returns:
semantic equal graph node, if exists null
otherwise
getEqualIdGraphNode
Returns the graph node whose id is equal to the given node from the internal list of
graphnodes.
Parameters:
node
-
Returns:
graph node with equal id, if exists null
otherwise
updateGraphNodeId
Updates the internal list of registered graphnodes, when an id of a graph node changed.
Parameters:
oldId
-
newId
-
getGraphNode
Returns the graphnode with the given id from the internal list of graphnodes.
Parameters:
id
- The id of the graphnode, which should be retrieved.
Returns:
getGraphEdge
Returns the graph edge with the specified id.
Parameters:
id
- the id of the graph edge
Returns:
the edge
getGraphNodes
Returns the complete list of graph nodes registered in the graph.
Returns:
list of graph nodes in the graph.
getGraphNodes
Returns a list of graph nodes registered in the graph.
Parameters:
filter
- filter to apply
Returns:
list of graph nodes in the graph
getGraphEdges
Returns the complete list of graphedges contained in the graph
Returns:
List of graphedges in the graph.
containsValueFrom
Checks, whether the given graph is entirely contained in this graph.
Parameters:
graph
- given graph
Returns:
true, if the given graph is entirely contained in this graph
containsValueFromWithExceptions
Checks, whether the given graph is entirely contained in this graph.
Parameters:
graph
- given graph
Returns:
true, if the given graph is entirely contained in this graph
Throws:
AssertSameValueAsInException
- exception with explanations
getIDManager
Returns the ID-manager for this graph.
Returns:
getNumberOfNodes
int getNumberOfNodes ()
Returns:
getNumberOfEdges
int getNumberOfEdges ()
Returns:
getModifier
Returns the modifier.
Returns:
getVisualizer
Returns the default visualizer for this graph.
Returns: