chore: updated C core; some tests will fail now

Author: ntamas

doc/examples_sphinx-gallery/spanning_trees.py

@@ -29,7 +29,7 @@
 g = g.permute_vertices(permutation)
 new_layout = g.layout("grid")
 for i in range(36):
-    new_layout[permutation[i]] = layout[i]
+    new_layout[i] = layout[permutation[i]]
 layout = new_layout
 
 # %%

src/_igraph/bfsiter.c

@@ -167,7 +167,7 @@ static PyObject* igraphmodule_BFSIter_iternext(igraphmodule_BFSIterObject* self)
     igraph_integer_t parent = igraph_dqueue_int_pop(&self->queue);
     igraph_integer_t i, n;
 
-    if (igraph_neighbors(self->graph, &self->neis, vid, self->mode)) {
+    if (igraph_neighbors(self->graph, &self->neis, vid, self->mode, /* loops = */ 0, /* multiple = */ 0)) {
       igraphmodule_handle_igraph_error();
       return NULL;
     }

src/_igraph/dfsiter.c

@@ -192,7 +192,7 @@ static PyObject* igraphmodule_DFSIter_iternext(igraphmodule_DFSIterObject* self)
     /* the values above are returned at at this stage. However, we must
      * prepare for the next iteration by putting the next unvisited
      * neighbor onto the stack */
-    if (igraph_neighbors(self->graph, &self->neis, vid, self->mode)) {
+    if (igraph_neighbors(self->graph, &self->neis, vid, self->mode, /* loops = */ 0, /* multiple = */ 0)) {
       igraphmodule_handle_igraph_error();
       return NULL;
     }