tideman.c
void lock_pairs(void)
{
    // set first edge
    locked[pairs[0].winner][pairs[0].loser] = true;

    for (int i = 1 ; i < pair_count ; i++)
    {
        if (cyclecheck(i, pairs[i].winner, pairs[i].loser) == true)
        {
            locked[pairs[i].winner][pairs[i].loser] = true;
            //printf("i: %i, %d\n", i, locked[pairs[i].winner][pairs[i].loser]);
        }
    }
    return;
}
// Lock pairs into the candidate graph in order, without creating cycles
Lock pairs into the candidate graph in order, without creating cycles
Lock pairs into the candidate graph in order without creating cycles
void lock_pairs(void)
{
    locked[pairs[0].winner][pairs[0].loser] = true;
    for (int i = 1 ; i < pair_count ; i++)
    {
        if (cyclecheck(i, pairs[i].winner, pairs[i].loser) == true)
        {
            locked[pairs[i].winner][pairs[i].loser] = true;
        }
    }
    return;
}
void lock_pairs ( void ) { locked [ pairs [ 0 ] . winner ] [ pairs [ 0 ] . loser ] = true ; for ( int i = 1 ; i < pair_count ; i ++ ) { if ( cyclecheck ( i , pairs [ i ] . winner , pairs [ i ] . loser ) == true ) { locked [ pairs [ i ] . winner ] [ pairs [ i ] . loser ] = true ; } } return ; }
Lock pairs into the candidate graph in order, without creating cycles
Lock pairs into the candidate graph in order without creating cycles
// set first edge //printf("i: %i, %d\n", i, locked[pairs[i].winner][pairs[i].loser]);