return node;
}
-static void vector_remove(vector v, unsigned int ix)
+static void graph_vector_remove(vector v, unsigned int ix)
{
if (ix >= v->active)
return;
// remove node from graph->nodes
for (unsigned int i = vector_active(graph->nodes); i--; /**/)
if (vector_slot(graph->nodes, i) == node) {
- vector_remove(graph->nodes, i);
+ graph_vector_remove(graph->nodes, i);
break;
}
// remove from from to->from
for (unsigned int i = vector_active(to->from); i--; /**/)
if (vector_slot(to->from, i) == from) {
- vector_remove(to->from, i);
+ graph_vector_remove(to->from, i);
break;
}
// remove to from from->to
for (unsigned int i = vector_active(from->to); i--; /**/)
if (vector_slot(from->to, i) == to) {
- vector_remove(from->to, i);
+ graph_vector_remove(from->to, i);
break;
}
}