|
|
|
Strong Connection |
| |
By definition, a strong connection exists between two candidates where, if one is false, then the other must be true.
In most cases, a strong connection exists between two candidates whenever they are the only two candidates in a unit. If one is false, then the remaining candidate is the last in the unit and must be true.
By extension two candidates at opposite ends of a chain of any type are strongly connected if the first and last connections in the chain are both strong.
|
|
|
|
|
|
|
|
