|
|
Index | a = 0 |
|
Index | b = 0 |
|
unsigned char | capacity = 1 |
| | Largest extra order this edge may carry.
|
| unsigned char | preferred = 0 |
|
double | score = 0.0 |
◆ preferred
| unsigned char preferred = 0 |
The extra order the caller would like to try first (0 to capacity), and how strongly it likes the edge to be raised at all: edges at a vertex are branched on in order of decreasing score. Both only steer the search order; they never change which solutions are valid. Callers always set preferred. With no geometric information use preferred = capacity and score = 0, which tries the highest order first in edge order.
The documentation for this struct was generated from the following file: