Removed unused variables and addes some asserts.
authorSebastian Buchwald <Sebastian.Buchwald@kit.edu>
Wed, 3 Dec 2008 21:07:59 +0000 (21:07 +0000)
committerSebastian Buchwald <Sebastian.Buchwald@kit.edu>
Wed, 3 Dec 2008 21:07:59 +0000 (21:07 +0000)
[r24275]

heuristical.c

index 3c81960..1904325 100644 (file)
@@ -855,17 +855,11 @@ static void apply_brute_force_reductions(pbqp *pbqp)
 
 static unsigned get_minimal_alternative(pbqp *pbqp, pbqp_node *node)
 {
-       pbqp_edge   *edge;
        vector      *node_vec;
-       vector      *vec;
-       pbqp_matrix *mat;
-       unsigned     edge_index;
-       unsigned     max_degree   = 0;
        unsigned     node_index;
        unsigned     node_len;
        unsigned     min_index    = 0;
        num          min          = INF_COSTS;
-       int          is_src;
 
        assert(pbqp);
        assert(node);
@@ -896,6 +890,11 @@ static unsigned get_minimal_alternative(pbqp *pbqp, pbqp_node *node)
                        min_index = node_index;
                }
 
+               /* Some node buckets and the edge bucket should still be empty. */
+               assert(node_bucket_get_length(node_buckets[1]) == 0);
+               assert(node_bucket_get_length(node_buckets[2]) == 0);
+               assert(edge_bucket_get_length(edge_bucket)     == 0);
+
                /* TODO Restore old PBQP state. */
 
        }