simurq

// 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;