passagemath-graphs 10.5.10__cp39-cp39-macosx_14_0_arm64.whl → 10.5.43__cp39-cp39-macosx_14_0_arm64.whl

sage/graphs/base/static_sparse_backend.pyx

@@ -558,9 +558,28 @@ cdef class StaticSparseBackend(CGraphBackend):
         """
         return v in self._vertex_to_int
 
+    def add_vertex(self, object v):
+        r"""
+        Add a vertex to the graph. No way
+
+        INPUT:
+
+        - ``v`` -- a vertex (or not?)
+
+        TESTS::
+
+            sage: from sage.graphs.base.static_sparse_backend import StaticSparseBackend
+            sage: g = StaticSparseBackend(graphs.PetersenGraph())
+            sage: g.add_vertex(123)
+            Traceback (most recent call last):
+            ...
+            ValueError: graph is immutable; please change a copy instead (use function copy())
+        """
+        raise ValueError("graph is immutable; please change a copy instead (use function copy())")
+
     cpdef add_edge(self, object u, object v, object l, bint directed):
         r"""
-        Set edge label. No way.
+        Add an edge to the graph. No way.
 
         TESTS::
 
@@ -573,9 +592,13 @@ cdef class StaticSparseBackend(CGraphBackend):
         """
         raise ValueError("graph is immutable; please change a copy instead (use function copy())")
 
-    def add_edges(self, edges, directed):
+    def add_edges(self, edges, directed, remove_loops=False):
         r"""
-        Set edge label. No way.
+        Add edges to the graph. No way.
+
+        INPUT:
+
+        - ``edges`` -- a list of edges (or not?)
 
         TESTS::
 
@@ -590,7 +613,11 @@ cdef class StaticSparseBackend(CGraphBackend):
 
     def add_vertices(self, vertices):
         r"""
-        Set edge label. No way.
+        Add vertices to the graph. No way.
+
+        INPUT:
+
+        - ``vertices`` -- a list of vertices (or not?)
 
         TESTS::
 
@@ -603,15 +630,75 @@ cdef class StaticSparseBackend(CGraphBackend):
         """
         raise ValueError("graph is immutable; please change a copy instead (use function copy())")
 
+    def del_vertex(self, object v):
+        r"""
+        Delete a vertex from the graph. No way
+
+        INPUT:
+
+        - ``v`` -- a vertex (or not?)
+
+        TESTS::
+
+            sage: from sage.graphs.base.static_sparse_backend import StaticSparseBackend
+            sage: g = StaticSparseBackend(graphs.PetersenGraph())
+            sage: g.del_vertex(123)
+            Traceback (most recent call last):
+            ...
+            ValueError: graph is immutable; please change a copy instead (use function copy())
+
+        Check that :issue:`39270` is fixed::
+
+            sage: g.del_vertex('a')
+            Traceback (most recent call last):
+            ...
+            ValueError: graph is immutable; please change a copy instead (use function copy())
+        """
+        raise ValueError("graph is immutable; please change a copy instead (use function copy())")
+
+    def del_vertices(self, vertices):
+        r"""
+        Delete vertices from the graph. No way
+
+        INPUT:
+
+        - ``vertices`` -- a list of vertices (or not?)
+
+        TESTS::
+
+            sage: from sage.graphs.base.static_sparse_backend import StaticSparseBackend
+            sage: g = StaticSparseBackend(graphs.PetersenGraph())
+            sage: g.del_vertices([123, 234])
+            Traceback (most recent call last):
+            ...
+            ValueError: graph is immutable; please change a copy instead (use function copy())
+        """
+        raise ValueError("graph is immutable; please change a copy instead (use function copy())")
+
     cpdef del_edge(self, object u, object v, object l, bint directed):
         r"""
-        Set edge label. No way.
+        Delete an edge of the graph. No way.
 
         TESTS::
 
             sage: from sage.graphs.base.static_sparse_backend import StaticSparseBackend
             sage: g = StaticSparseBackend(graphs.PetersenGraph())
-            sage: g.set_edge_label(1,2,3,True)
+            sage: g.del_edge(1,2,3,True)
+            Traceback (most recent call last):
+            ...
+            ValueError: graph is immutable; please change a copy instead (use function copy())
+        """
+        raise ValueError("graph is immutable; please change a copy instead (use function copy())")
+
+    def del_edges(self, edges, directed):
+        r"""
+        Delete edges of the graph. No way.
+
+        TESTS::
+
+            sage: from sage.graphs.base.static_sparse_backend import StaticSparseBackend
+            sage: g = StaticSparseBackend(graphs.PetersenGraph())
+            sage: g.del_edges([[1,2,3]], True)
             Traceback (most recent call last):
             ...
             ValueError: graph is immutable; please change a copy instead (use function copy())

sage/graphs/base/static_sparse_graph.pyx

@@ -329,7 +329,7 @@ cdef int init_short_digraph(short_digraph g, G, edge_labelled=False,
             g.neighbors[j][0] = i
             # Note: cannot use the dereference Cython operator here, do not
             # known why but the following line does not compile
-            #dereference(g.neighbors[j]) = i
+            # dereference(g.neighbors[j]) = i
             if edge_labelled:
                 edge_labels[g.neighbors[j] - g.edges] = e[2]
             postincrement(g.neighbors[j])  # increment pointer to next item

sage/graphs/bipartite_graph.py

@@ -1071,7 +1071,6 @@ class BipartiteGraph(Graph):
 
         # add the edge
         Graph.add_edge(self, u, v, label)
-        return
 
     def add_edges(self, edges, loops=True):
         """