+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;
+}
+