| 190 | } |
| 191 | |
| 192 | double HighsNodeQueue::link(int64_t node) { |
| 193 | if (nodes[node].lower_bound > optimality_limit) { |
| 194 | assert(nodes[node].estimate != kHighsInf); |
| 195 | nodes[node].estimate = kHighsInf; |
| 196 | link_suboptimal(node); |
| 197 | link_domchgs(node); |
| 198 | return std::ldexp(1.0, 1 - nodes[node].depth); |
| 199 | } |
| 200 | |
| 201 | link_estim(node); |
| 202 | link_lower(node); |
| 203 | link_domchgs(node); |
| 204 | return 0.0; |
| 205 | } |
| 206 | |
| 207 | void HighsNodeQueue::unlink(int64_t node) { |
| 208 | if (nodes[node].estimate == kHighsInf) { |
no outgoing calls
no test coverage detected