- if(other == c)
- continue;
- for(node2 = node_tree->head; node2; node2 = node2->next)
- {
- n = (node_t *)node2->data;
- if(n->nexthop == c->node)
- {
- send_del_node(other, n);
- n->status.reachable = 0;
- }
- }
+ if(other->status.active && other != c)
+ send_del_edge(other, c->edge);