7 * Create an empty PBQP instance with the given number of nodes.
9 pbqp* alloc_pbqp(int 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, int node_index, vector *costs);
22 * Add costs matrix between given nodes.
24 void add_edge_costs(pbqp *pbqp, int src_index, int tgt_index, matrix *costs);
26 pbqp_edge *get_edge(pbqp *pbqp, int src_index, int tgt_index);
27 pbqp_node *get_node(pbqp *pbqp, int index);
29 #endif /* KAPS_KAPS_H */