|
|
|
Weak Connection |
| |
By definition, a weak connection exists between two candidates where, if one is true, then the other must be false.
In general, a weak connection exists between any two candidates that share a unit. If one is true, then because a unit can only have one value, the other must be false.
By extension two candidates at opposite ends of a chain of any type are weakly connected if the first and last connections in the chain are both weak.
|
|
|
|
|
|
|
|
