- break;
- }
- }
-
- pbqp->solution = determine_solution(pbqp->dump_file);
-
- if (pbqp->dump_file) {
- dump_section(pbqp->dump_file, 2, "Minimum");
- fprintf(pbqp->dump_file, "Minimum is equal to %lld.", pbqp->solution);
- dump_section(pbqp->dump_file, 2, "Back Propagation");
- }
-
- /* Solve reduced nodes. */
- node_len = node_bucket_get_length(reduced_bucket);
- for (node_index = node_len; node_index > 0; --node_index) {
- pbqp_node *node = reduced_bucket[node_index - 1];
-
- switch (pbqp_node_get_degree(node)) {
- case 1:
- back_propagate_RI(pbqp, node);
- break;
- case 2:
- back_propagate_RII(pbqp, node);
- break;
- default:
- panic("Only nodes with degree one or two should be in this bucket");
- break;
- }
- }
-
- free_buckets();
-}
-
-void apply_edge(pbqp *pbqp)
-{
- pbqp_edge *edge = edge_bucket_pop(&edge_bucket);
-
- simplify_edge(pbqp, edge);
-}
-
-void apply_RI(pbqp *pbqp)
-{
- pbqp_node *node = node_bucket_pop(&node_buckets[1]);
- pbqp_edge *edge = node->edges[0];
- pbqp_matrix *mat = edge->costs;
- int is_src = edge->src == node;
- pbqp_node *other_node;
-
- if (is_src) {
- other_node = edge->tgt;
- } else {
- other_node = edge->src;
- }
-
- if (pbqp->dump_file) {
- char txt[100];
- sprintf(txt, "RI-Reduction of Node n%d", node->index);
- dump_section(pbqp->dump_file, 2, txt);
- pbqp_dump_graph(pbqp);
- fputs("<br>\nBefore reduction:<br>\n", pbqp->dump_file);
- dump_node(pbqp->dump_file, node);
- dump_node(pbqp->dump_file, other_node);
- dump_edge(pbqp->dump_file, edge);
- }
-
- if (is_src) {
- pbqp_matrix_add_to_all_cols(mat, node->costs);
- normalize_towards_target(pbqp, edge);
- } else {
- pbqp_matrix_add_to_all_rows(mat, node->costs);
- normalize_towards_source(pbqp, edge);
- }
- disconnect_edge(other_node, edge);
-
- if (pbqp->dump_file) {
- fputs("<br>\nAfter reduction:<br>\n", pbqp->dump_file);
- dump_node(pbqp->dump_file, other_node);
- }
-
- reorder_node(other_node);
-
- /* Add node to back propagation list. */
- node_bucket_insert(&reduced_bucket, node);
-}
-
-void apply_RII(pbqp *pbqp)
-{
- pbqp_node *node = node_bucket_pop(&node_buckets[2]);
- pbqp_edge *src_edge = node->edges[0];
- pbqp_edge *tgt_edge = node->edges[1];
- int src_is_src = src_edge->src == node;
- int tgt_is_src = tgt_edge->src == node;
- pbqp_matrix *src_mat;
- pbqp_matrix *tgt_mat;
- pbqp_node *src_node;
- pbqp_node *tgt_node;
- pbqp_matrix *mat;
- vector *vec;
- vector *node_vec;
- vector *src_vec;
- vector *tgt_vec;
- unsigned col_index;
- unsigned col_len;
- unsigned row_index;
- unsigned row_len;
- unsigned node_len;
-
- assert(pbqp);
-
- if (src_is_src) {
- src_node = src_edge->tgt;
- } else {
- src_node = src_edge->src;
- }
-
- if (tgt_is_src) {
- tgt_node = tgt_edge->tgt;
- } else {
- tgt_node = tgt_edge->src;
- }
-
- /* Swap nodes if necessary. */
- if (tgt_node->index < src_node->index) {
- pbqp_node *tmp_node;
- pbqp_edge *tmp_edge;
-
- tmp_node = src_node;
- src_node = tgt_node;
- tgt_node = tmp_node;
-
- tmp_edge = src_edge;
- src_edge = tgt_edge;
- tgt_edge = tmp_edge;
-
- src_is_src = src_edge->src == node;
- tgt_is_src = tgt_edge->src == node;
- }
-
- if (pbqp->dump_file) {
- char txt[100];
- sprintf(txt, "RII-Reduction of Node n%d", node->index);
- dump_section(pbqp->dump_file, 2, txt);
- pbqp_dump_graph(pbqp);
- fputs("<br>\nBefore reduction:<br>\n", pbqp->dump_file);
- dump_node(pbqp->dump_file, src_node);
- dump_edge(pbqp->dump_file, src_edge);
- dump_node(pbqp->dump_file, node);
- dump_edge(pbqp->dump_file, tgt_edge);
- dump_node(pbqp->dump_file, tgt_node);
- }
-
- src_mat = src_edge->costs;
- tgt_mat = tgt_edge->costs;
-
- src_vec = src_node->costs;
- tgt_vec = tgt_node->costs;
- node_vec = node->costs;
-
- row_len = src_vec->len;
- col_len = tgt_vec->len;
- node_len = node_vec->len;
-
- mat = pbqp_matrix_alloc(pbqp, row_len, col_len);
-
- for (row_index = 0; row_index < row_len; ++row_index) {
- for (col_index = 0; col_index < col_len; ++col_index) {
- vec = vector_copy(pbqp, node_vec);
-
- if (src_is_src) {
- vector_add_matrix_col(vec, src_mat, row_index);
- } else {
- vector_add_matrix_row(vec, src_mat, row_index);
- }
-
- if (tgt_is_src) {
- vector_add_matrix_col(vec, tgt_mat, col_index);
- } else {
- vector_add_matrix_row(vec, tgt_mat, col_index);
- }
-
- mat->entries[row_index * col_len + col_index] = vector_get_min(vec);
-
- obstack_free(&pbqp->obstack, vec);