class DiscreteDecisionNode : public Node The discrete decision node. Base class for all decision nodes.
The discrete decision node. Base class for all decision nodes.
void addParent(DiscreteDecisionNode *parent) throw( HAPI::ExceptionHugin )
void enterFinding(int state, double value) throw( ExceptionHugin )
- <b>value</b> A non-negative real number as the finding value.
int getCaseState(long index) throw(HAPI::ExceptionHugin)
virtual Category getCategory() throw()
NodeList getChildren() const throw( HAPI::ExceptionHugin )
double getEnteredFinding(int state) const throw( ExceptionHugin )
double getExpectedUtility(int state) const throw( ExceptionHugin )
virtual Kind getKind() throw()
int getNumberOfStates() const throw()
double getPropagatedFinding(int state) const throw( ExceptionHugin )
std::string getStateLabel(int state) const throw()
bool isEvidenceEntered()
bool isEvidencePropagated()
void removeParent(DiscreteChanceNode *parent) throw( HAPI::ExceptionHugin )
void removeParent(DiscreteDecisionNode *parent) throw( HAPI::ExceptionHugin )
void retractFindings() throw( ExceptionHugin )
void selectState(int state) throw( ExceptionHugin )
void setCaseState(long index, int state) throw(HAPI::ExceptionHugin)
state - The node state.
void setStateLabel(int state, std::string& statelabel) throw(HAPI::ExceptionHugin)
statelabel - - The desired state label.
void setStateLabel(int state, char *statelabel) throw(HAPI::ExceptionHugin)
statelabel - - The desired state label.
void unsetCase(long index)
alphabetic index hierarchy of classes
this page has been generated automatically by doc++
(c)opyright by Malte Zöckler, Roland Wunderling
contact: doc++@zib.de