deploy/DeepStream/src/Lapjv.cpp
/** Find columns with minimum d[j] and put them on the SCAN list.
 */
Find columns with minimum d[j] and put them on the SCAN list.
Find columns with minimum d [ j ] and put them on the SCAN list .
uint_t _find_dense(const uint_t n, uint_t lo, cost_t *d, int_t *cols, int_t *y) {
    uint_t      hi   = lo + 1;
    cost_t      mind = d[cols[lo]];
    for (uint_t k    = hi; k < n; k++) {
        int_t j = cols[k];
        if (d[j] <= mind) {
            if (d[j] < mind) {
                hi   = lo;
                mind = d[j];
            }
            cols[k]    = cols[hi];
            cols[hi++] = j;
        }
    }
    return hi;
}
uint_t _find_dense ( const uint_t n , uint_t lo , cost_t * d , int_t * cols , int_t * y ) { uint_t hi = lo + 1 ; cost_t mind = d [ cols [ lo ] ] ; for ( uint_t k = hi ; k < n ; k ++ ) { int_t j = cols [ k ] ; if ( d [ j ] <= mind ) { if ( d [ j ] < mind ) { hi = lo ; mind = d [ j ] ; } cols [ k ] = cols [ hi ] ; cols [ hi ++ ] = j ; } } return hi ; }
Find columns with minimum d[j] and put them on the SCAN list.
Find columns with minimum d [ j ] and put them on the SCAN list .