View locked_pairs.c
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// Lock pairs into the candidate graph in order, without creating cycles | |
void lock_pairs(void) | |
{ | |
int i, j, row, win, los, cycle; | |
for (i = 0; i < pair_count; i++) | |
{ | |
win = pairs[i].winner; | |
los = row = pairs[i].loser; | |
cycle = 0; |