+
+void vector_add_value(vector *vec, num value)
+{
+ unsigned index;
+ unsigned len;
+
+ assert(vec);
+
+ len = vec->len;
+
+ for (index = 0; index < len; ++index) {
+ vec->entries[index].data = pbqp_add(vec->entries[index].data, value);
+ }
+}
+
+void vector_add_matrix_col(vector *vec, pbqp_matrix *mat, unsigned col_index)
+{
+ unsigned index;
+ unsigned len;
+
+ assert(vec);
+ assert(mat);
+ assert(vec->len == mat->rows);
+ assert(col_index < mat->cols);
+
+ len = vec->len;
+
+ for (index = 0; index < len; ++index) {
+ vec->entries[index].data = pbqp_add(vec->entries[index].data, mat->entries[index * mat->cols + col_index]);
+ }
+}
+
+void vector_add_matrix_row(vector *vec, pbqp_matrix *mat, unsigned row_index)
+{
+ unsigned index;
+ unsigned len;
+
+ assert(vec);
+ assert(mat);
+ assert(vec->len == mat->cols);
+ assert(row_index < mat->rows);
+
+ len = vec->len;
+
+ for (index = 0; index < len; ++index) {
+ vec->entries[index].data = pbqp_add(vec->entries[index].data,
+ mat->entries[row_index * mat->cols + index]);
+ }
+}
+
+num vector_get_min(vector *vec)
+{
+ unsigned index;
+ unsigned len;
+ num min = INF_COSTS;
+
+ assert(vec);
+
+ len = vec->len;
+ assert(len > 0);
+
+ for (index = 0; index < len; ++index) {
+ num elem = vec->entries[index].data;
+
+ if (elem < min) {
+ min = elem;
+ }
+ }
+
+ return min;
+}
+
+unsigned vector_get_min_index(vector *vec)
+{
+ unsigned index;
+ unsigned len;
+ unsigned min_index = 0;
+ num min = INF_COSTS;
+
+ assert(vec);
+
+ len = vec->len;
+ assert(len > 0);
+
+ for (index = 0; index < len; ++index) {
+ num elem = vec->entries[index].data;
+
+ if (elem < min) {
+ min = elem;
+ min_index = index;
+ }
+ }
+
+ return min_index;
+}