Gecode::Scheduling::Unary::OmegaNode Class Reference
Node for an omega tree. More...
#include <unary.hh>
Public Member Functions | |
| void | init (const OmegaNode &l, const OmegaNode &r) |
| Initialize node from left child l and right child r. | |
| void | update (const OmegaNode &l, const OmegaNode &r) |
| Update node from left child l and right child r. | |
Public Attributes | |
| int | p |
| Processing time for subtree. | |
| int | ect |
| Earliest completion time for subtree. | |
Detailed Description
Node for an omega tree.
Definition at line 257 of file unary.hh.
Member Function Documentation
| void Gecode::Scheduling::Unary::OmegaNode::init | ( | const OmegaNode & | l, | |
| const OmegaNode & | r | |||
| ) | [inline] |
Initialize node from left child l and right child r.
Reimplemented in Gecode::Scheduling::Unary::OmegaLambdaNode.
| void Gecode::Scheduling::Unary::OmegaNode::update | ( | const OmegaNode & | l, | |
| const OmegaNode & | r | |||
| ) | [inline] |
Update node from left child l and right child r.
Reimplemented in Gecode::Scheduling::Unary::OmegaLambdaNode.
Member Data Documentation
The documentation for this class was generated from the following files:
- gecode/scheduling/unary.hh (Revision: 9878)
- gecode/scheduling/unary/tree.hpp (Revision: 9815)
