|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object | +--at.dms.jperf.Graph
This class represents the intermediate graph.
Constructor Summary | |
Graph(long maxNodeValue)
Constructs a new graph object. |
Method Summary | |
boolean |
addEdge(long label1,
long label2,
long edge)
Adds an edge (and the corresponding nodes if necessary) to the graph. |
void |
addNode(Node node)
Adds a node to the graph. |
void |
assignGValues(int keywordCount)
Sets g-values for all nodes. |
void |
clearVisited()
Clears visited flags of all nodes. |
Node |
findNode(long label)
Searches node with given label the intermediate graph. |
void |
genCode(java.io.PrintWriter out)
Outputs g-values. |
void |
init()
Initializes the internal structures. |
Methods inherited from class java.lang.Object |
|
Constructor Detail |
public Graph(long maxNodeValue)
Method Detail |
public void init()
public void addNode(Node node)
node
- the node to add.public Node findNode(long label)
label
- The node label.public boolean addEdge(long label1, long label2, long edge)
label1
- The label of the source node.label2
- The label of the target node.edge
- The edge value.true
iff the graph is still acyclic.public void clearVisited()
public void assignGValues(int keywordCount)
public void genCode(java.io.PrintWriter out)
out
- The output stream.
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |