|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectmocgraph.Graph
mocgraph.DirectedGraph
mapss.dif.DIFGraph
mapss.dif.psdf.PSDFSpecificationGraph
public class PSDFSpecificationGraph
Information associated with a PSDFSpecification graph. PSDF specification has only three subgraphs: init, subinit, body. The PSDFSpecificationGraph is used as the base graph for PSDFSpecification (which extends DIFGraph). When initiate the PSDFSpecificationGraph, it will automatically add three supernodes: init, subinit, body. Any modification on graph topology such as addNode or addEdge are not allowed in this class.
PSDFSpecification
Constructor Summary | |
---|---|
PSDFSpecificationGraph()
Construct a PSDFSpecificationGraph with init, subinint, and body nodes. |
Method Summary | |
---|---|
protected void |
_registerEdge(mocgraph.Edge edge)
Register a new edge in the graph. |
protected void |
_registerNode(mocgraph.Node node)
Register a new node in the graph. |
PSDFAttributeType |
getGraphType()
|
void |
setGraphType(PSDFAttributeType type)
set type to either PSDFAttributeType.InitGraph, PSDFAttributeType.SubinitGraph, PSDFAttributeType.BodyGraph, or PSDFAttributeType.PSDFSpecification. |
boolean |
validEdgeWeight(java.lang.Object weight)
Verify edge weight for PSDFSpecificationGraph. |
boolean |
validNodeWeight(java.lang.Object weight)
Verify node weight for PSDF graph. |
Methods inherited from class mocgraph.DirectedGraph |
---|
_connect, _connectedSubGraph, _disconnect, _initializeAnalyses, backwardReachableNodes, backwardReachableNodes, backwardReachableNodes, backwardReachableNodes, cycleNodeCollection, cycleNodes, edgeExists, edgeExists, inputEdgeCount, inputEdges, isAcyclic, outputEdgeCount, outputEdges, predecessorEdges, predecessors, reachableNodes, reachableNodes, reachableNodes, reachableNodes, sccDecomposition, selfLoopEdgeCount, sinkNodeCount, sinkNodes, sourceNodeCount, sourceNodes, subgraphs, successorEdges, successors, toDirectedAcyclicGraph, topologicalSort, topologicalSort, transitiveClosure |
Methods inherited from class mocgraph.Graph |
---|
_addEdge, _connectEdge, _disconnectEdge, _emptyGraph, _registerChange, addAnalysis, addEdge, addEdge, addEdge, addEdges, addGraph, addNode, addNode, addNodes, addNodeWeight, addNodeWeights, changeCount, clone, cloneAs, connectedComponents, containsEdge, containsEdgeWeight, containsNode, containsNodeWeight, edge, edge, edgeCount, edgeLabel, edgeLabel, edges, edges, edges, edgeWeight, hidden, hiddenEdgeCount, hiddenEdges, incidentEdgeCount, incidentEdges, neighborEdges, neighbors, node, node, nodeCount, nodeLabel, nodeLabel, nodes, nodes, nodes, nodeWeight, selfLoopEdgeCount, selfLoopEdges, selfLoopEdges, toString, validateWeight, validateWeight, validateWeight, validateWeight, weightArray |
Methods inherited from class java.lang.Object |
---|
finalize, getClass, notify, notifyAll, wait, wait, wait |
Constructor Detail |
---|
public PSDFSpecificationGraph()
Method Detail |
---|
public PSDFAttributeType getGraphType()
public void setGraphType(PSDFAttributeType type)
type
- PSDFAttributeTypepublic boolean validEdgeWeight(java.lang.Object weight)
validEdgeWeight
in class DIFGraph
weight
- The edge weight to verify.
public boolean validNodeWeight(java.lang.Object weight)
validNodeWeight
in class DIFGraph
weight
- The node weight to verify.
protected void _registerEdge(mocgraph.Edge edge)
DIFGraph
_registerEdge
in class DIFGraph
edge
- The new edge.protected void _registerNode(mocgraph.Node node)
DIFGraph
_registerNode
in class DIFGraph
node
- The new node.
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |