solution.c File Reference

#include "mincov_int.h"

Include dependency graph for solution.c:

Go to the source code of this file.

Functions
ABC_NAMESPACE_IMPL_START solution_t *	solution_alloc ()
void	solution_free (solution_t *sol)
solution_t *	solution_dup (solution_t *sol)
void	solution_add (solution_t *sol, int *weight, int col)
void	solution_accept (solution_t *sol, sm_matrix *A, int *weight, int col)
void	solution_reject (solution_t *sol, sm_matrix *A, int *weight, int col)
solution_t *	solution_choose_best (solution_t *best1, solution_t *best2)

Function Documentation

solution_accept()

void solution_accept	(	solution_t *	sol,
		sm_matrix *	A,
		int *	weight,
		int	col )

Definition at line 62 of file solution.c.

{
    register sm_element *p, *pnext;
    sm_col *pcol;
 
    solution_add(sol, weight, col);
 
    /* delete rows covered by this column */
    pcol = sm_get_col(A, col);
    for(p = pcol->first_row; p != 0; p = pnext) {
    pnext = p->next_row;        /* grab it before it disappears */
    sm_delrow(A, p->row_num);
    }
}

Here is the call graph for this function:

solution_add()

void solution_add	(	solution_t *	sol,
		int *	weight,
		int	col )

Definition at line 51 of file solution.c.

{
    (void) sm_row_insert(sol->row, col);
    sol->cost += WEIGHT(weight, col);
}

Here is the call graph for this function:

solution_alloc()

ABC_NAMESPACE_IMPL_START solution_t * solution_alloc

(

)

Definition at line 17 of file solution.c.

{
    solution_t *sol;
 
    sol = ALLOC(solution_t, 1);
    sol->cost = 0;
    sol->row = sm_row_alloc();
    return sol;
}

Here is the call graph for this function:

Here is the caller graph for this function:

solution_choose_best()

solution_t * solution_choose_best	(	solution_t *	best1,
		solution_t *	best2 )

Definition at line 95 of file solution.c.

{
    if (best1 != NIL(solution_t)) {
    if (best2 != NIL(solution_t)) {
        if (best1->cost <= best2->cost) {
        solution_free(best2);
        return best1;
        } else {
        solution_free(best1);
        return best2;
        }
    } else {
        return best1;
    }
    } else {
    if (best2 != NIL(solution_t)) {
        return best2;
    } else {
        return NIL(solution_t);
    }
    }
}

Here is the call graph for this function:

solution_dup()

solution_t * solution_dup

(

solution_t *

sol

)

Definition at line 38 of file solution.c.

{
    solution_t *new_sol;
 
    new_sol = ALLOC(solution_t, 1);
    new_sol->cost = sol->cost;
    new_sol->row = sm_row_dup(sol->row);
    return new_sol;
}

Here is the call graph for this function:

solution_free()

void solution_free

(

solution_t *

sol

)

Definition at line 29 of file solution.c.

{
    sm_row_free(sol->row);
    FREE(sol);
}

Here is the call graph for this function:

solution_reject()

void solution_reject	(	solution_t *	sol,
		sm_matrix *	A,
		int *	weight,
		int	col )

Definition at line 84 of file solution.c.

{
    sm_delcol(A, col);
}

Here is the call graph for this function: