#include "pbqp_node.h"
#include "pbqp_node_t.h"
+#include "pbqp_edge_t.h"
#include "vector.h"
-pbqp_node *alloc_node(pbqp *pbqp, vector *costs)
+pbqp_node *alloc_node(pbqp *pbqp, unsigned node_index, vector *costs)
{
pbqp_node *node = obstack_alloc(&pbqp->obstack, sizeof(*node));
assert(node);
node->costs = vector_copy(pbqp, costs);
node->bucket_index = UINT_MAX;
node->solution = UINT_MAX;
+ node->index = node_index;
return node;
}
+int is_connected(pbqp_node *node, pbqp_edge *edge)
+{
+ pbqp_edge **edges;
+ unsigned edge_index;
+ unsigned edge_len;
+
+ assert(node);
+ assert(edge);
+
+ if (edge->src != node && edge->tgt != node) return 0;
+
+ edges = node->edges;
+ edge_len = ARR_LEN(edges);
+
+ for (edge_index = 0; edge_index < edge_len; ++edge_index) {
+ pbqp_edge *edge_candidate = edges[edge_index];
+ if (edge_candidate == edge) {
+ return 1;
+ }
+ }
+
+ return 0;
+}
+
void disconnect_edge(pbqp_node *node, pbqp_edge *edge)
{
pbqp_edge **edges;