|
|||||||||
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.csdf.CSDFGraph
mapss.dif.csdf.bcsdf.BCSDFGraph
public class BCSDFGraph
Information associated with an BCSDF graph. This class caches frequently-used data associated with BCSDF graphs. It is also useful for intermediate BCSDF graph representations that do not correspond to Ptolemy II models, and performing graph transformations (e.g. convertion to and manipulation of single-rate graphs). It is intended for use with analysis/synthesis algorithms that operate on generic graph representations of BCSDF models.
BCSDFGraph nodes and edges have weights of type
CSDFNodeWeight
and
BCSDFEdgeWeight
, respectively.
Constructor Summary | |
---|---|
BCSDFGraph()
Construct an empty BCSDF graph. |
|
BCSDFGraph(int nodeCount)
Construct an empty BCSDF graph with enough storage allocated for the specified number of nodes. |
|
BCSDFGraph(int nodeCount,
int edgeCount)
Construct an empty BCSDF graph with enough storage allocated for the specified number of edges, and number of nodes. |
Method Summary | |
---|---|
boolean |
validEdgeWeight(java.lang.Object weight)
Verify edge weight for CSDF graph. |
Methods inherited from class mapss.dif.csdf.CSDFGraph |
---|
_checkPeriods, _getPeriod, _getRepetitionsMap, checkRepetitions, computeRepetitions, getRepetitions, removeNode, setRepetitions, validNodeWeight |
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 BCSDFGraph()
public BCSDFGraph(int nodeCount)
nodeCount
- The number of nodes.public BCSDFGraph(int nodeCount, int edgeCount)
nodeCount
- The integer specifying the number of nodesedgeCount
- The integer specifying the number of edgesMethod Detail |
---|
public boolean validEdgeWeight(java.lang.Object weight)
validEdgeWeight
in class CSDFGraph
weight
- The edge weight to verify.
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |