T
- the actual type that describes the intermediate data model between two CalculationStepNode
spublic class CalculationGraph<T> extends edu.uci.ics.jung.graph.SparseGraph<CalculationStepNode<T>,CalculationTransition<T>>
CalculationStepNode
s and CalculationTransition
s.Constructor and Description |
---|
CalculationGraph() |
Modifier and Type | Method and Description |
---|---|
CalculationStepNode<T> |
addCalculationStepNode(javax.swing.tree.DefaultMutableTreeNode groupTreeNode,
java.util.HashMap<javax.swing.tree.DefaultMutableTreeNode,T> inNodeStates,
T outNodeState)
Creates and adds a CalculationStepNode to the current CalculationGraph.
|
CalculationTransition<T> |
addCalculationTransition(CalculationStepNode<T> nodeFrom,
CalculationStepNode<T> nodeTo)
Adds and returns a CalculationTransition between the specified CalculationStepNode's.
|
void |
addFinalCalculationStepNode(CalculationStepNode<T> newFinalNode)
Adds the specified final
CalculationStepNode to this CalculationGraph. |
CalculationStepNode<T> |
getCalculationStepNode(javax.swing.tree.DefaultMutableTreeNode groupNodeInitial)
Gets the calculation step node.
|
java.util.Vector<CalculationStepNode<T>> |
getFinalCalculationStepNodes()
Returns the final CalculationStepNode that were visited as end node during a sequential calculation.
|
CalculationStepNode<T> |
getInitialCalculationStepNode()
Gets the initial calculation step node.
|
void |
resetNodeStates()
Resets all in- and out-node states.
|
void |
setFinalCalculationStepNode(java.util.Vector<CalculationStepNode<T>> finalCalculationStepNodes)
Sets the final calculation step node.
|
void |
setInitialCalculationStepNode(CalculationStepNode<T> initialCalculationStepNode)
Sets the initial calculation step node.
|
CalcGraphFrame<T> |
showVisualisation()
Shows the visualisation of the current CalculationGraph.
|
addEdge, addVertex, containsEdge, containsVertex, findEdge, findEdgeSet, getDefaultEdgeType, getDest, getEdgeCount, getEdgeCount, getEdges, getEdges, getEdgeType, getEndpoints, getFactory, getIncidentEdges, getInEdges, getNeighbors, getOutEdges, getPredecessors, getSource, getSuccessors, getVertexCount, getVertices, isDest, isSource, removeEdge, removeVertex
addEdge, addEdge, addEdge, addEdge, addEdge, degree, getIncidentCount, getIncidentVertices, getNeighborCount, getOpposite, getPredecessorCount, getSuccessorCount, getValidatedEndpoints, inDegree, isIncident, isNeighbor, isPredecessor, isSuccessor, outDegree, toString
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
public CalculationStepNode<T> addCalculationStepNode(javax.swing.tree.DefaultMutableTreeNode groupTreeNode, java.util.HashMap<javax.swing.tree.DefaultMutableTreeNode,T> inNodeStates, T outNodeState)
groupTreeNode
- the group tree node from the GroupTreeModel
inNodeStates
- the in node statesoutNodeState
- the out node statepublic CalculationTransition<T> addCalculationTransition(CalculationStepNode<T> nodeFrom, CalculationStepNode<T> nodeTo)
nodeFrom
- the node from which the data have to be takennodeTo
- the node which the data has to be transferedpublic CalculationStepNode<T> getCalculationStepNode(javax.swing.tree.DefaultMutableTreeNode groupNodeInitial)
groupNodeInitial
- the group node initialpublic void resetNodeStates()
public CalculationStepNode<T> getInitialCalculationStepNode()
public void setInitialCalculationStepNode(CalculationStepNode<T> initialCalculationStepNode)
initialCalculationStepNode
- the new initial calculation step nodepublic java.util.Vector<CalculationStepNode<T>> getFinalCalculationStepNodes()
public void setFinalCalculationStepNode(java.util.Vector<CalculationStepNode<T>> finalCalculationStepNodes)
finalCalculationStepNodes
- the new final calculation step nodepublic void addFinalCalculationStepNode(CalculationStepNode<T> newFinalNode)
CalculationStepNode
to this CalculationGraph.newFinalNode
- the new final nodepublic CalcGraphFrame<T> showVisualisation()