CS计算机代考程序代写 /**

/**
* Algebraic Decision Diagram Package
*
* @author Scott Sanner (ssanner@gmail.com)
* @version 7/25/03
*
**/

package dd.discrete;

import graph.Graph;

public class ADDBNode extends ADDNode {

public boolean _bVal;

public ADDBNode(int lid, boolean bval) {
_nLocalID = lid;
_bVal = bval;
}

public void toGraph(Object context, Graph g) {
g.addNodeLabel(“#” + _nLocalID, “”+_bVal);
g.addNodeColor(“#” + _nLocalID, “lightsalmon”); // red, darkred
g.addNodeShape(“#” + _nLocalID, “square”);
g.addNodeStyle(“#” + _nLocalID, “filled”);

}

public String toString(Object context, int depth) {
return “[ #” + _nLocalID + ” <" + ((_bVal) ? "T" : "F" ) + "> ] “;
}
}