- adj_head_t *adj_head;
- list_element_t *new_element;
- list_element_t *element;
- int is_element = 0;
-
- adj_head = get_or_set_adj_head(ifg, a);
- list_for_each_entry(list_element_t, element, &adj_head->list, list){
- if(element->irn == b){
- is_element = 1;
- break;
+ adj_head_t *adj_head = NULL;
+ adj_element_t *curr_element = NULL;
+ adj_element_t *new_element = NULL;
+
+ adj_head = ifg->adj_heads[node_a->node_idx]; /* find the neighbours list of a */
+
+ assert (adj_head && "There is no entry for node a");
+ curr_element = adj_head->first_adj_element;
+
+ if (curr_element)
+ {
+ while (curr_element->neighbour != node_b && curr_element->next_adj_element)
+ {
+ curr_element = curr_element->next_adj_element;