7 #include "pbqp_edge_t.h"
9 #include "pbqp_node_t.h"
12 pbqp_edge *alloc_edge(pbqp *pbqp, int src_index, int tgt_index, pbqp_matrix *costs)
16 if (tgt_index < src_index) {
18 src_index = tgt_index;
24 pbqp_edge *edge = obstack_alloc(&pbqp->obstack, sizeof(*edge));
27 pbqp_node *src_node = get_node(pbqp, src_index);
30 pbqp_node *tgt_node = get_node(pbqp, tgt_index);
34 edge->costs = pbqp_matrix_copy_and_transpose(pbqp, costs);
36 edge->costs = pbqp_matrix_copy(pbqp, costs);
40 * Connect edge with incident nodes. Since the edge is allocated, we know
41 * that it don't appear in the edge lists of the nodes.
43 ARR_APP1(pbqp_edge *, src_node->edges, edge);
44 edge->src = src_index;
45 ARR_APP1(pbqp_edge *, tgt_node->edges, edge);
46 edge->tgt = tgt_index;
51 void delete_edge(pbqp *pbqp, pbqp_edge *edge)
58 src_node = get_node(pbqp, edge->src);
59 tgt_node = get_node(pbqp, edge->tgt);
63 disconnect_edge(src_node, edge);
64 disconnect_edge(tgt_node, edge);