7 * Create an empty PBQP instance with the given number of nodes.
9 pbqp* alloc_pbqp(unsigned number_nodes);
12 * Free the given PBQP.
14 void free_pbqp(pbqp *pbqp);
17 * Add costs vector to given node.
19 void add_node_costs(pbqp *pbqp, unsigned node_index, vector *costs);
22 * Add costs matrix between given nodes.
24 void add_edge_costs(pbqp *pbqp, unsigned src_index, unsigned tgt_index, pbqp_matrix *costs);
26 pbqp_edge *get_edge(pbqp *pbqp, unsigned src_index, unsigned tgt_index);
27 pbqp_node *get_node(pbqp *pbqp, unsigned index);
29 num get_node_solution(pbqp *pbqp, unsigned node_index);
30 num get_solution(pbqp *pbqp);
32 void set_dumpfile(pbqp *pbqp, FILE *f);
34 #endif /* KAPS_KAPS_H */