Adding and Removing Edge Lists

src/Graphs/abstractgraph.jl

@@ -379,3 +379,31 @@ function mincut_partitions(graph::AbstractGraph, distmx=weights(graph))
   parts = groupfind(first(mincut(graph, distmx)))
   return parts[1], parts[2]
 end
+
+"""Remove a list of edges from a graph g"""
+function rem_edges!(g::AbstractGraph, edges)
+  for e in edges
+    rem_edge!(g, e)
+  end
+  return g
+end
+
+function rem_edges(g::AbstractGraph, edges)
+  g = copy(g)
+  rem_edges!(g, edges)
+  return g
+end
+
+"""Add a list of edges to a graph g"""
+function add_edges!(g::AbstractGraph, edges)
+  for e in edges
+    add_edge!(g, e)
+  end
+  return g
+end
+
+function add_edges(g::AbstractGraph, edges)
+  g = copy(g)
+  add_edges!(g, edges)
+  return g
+end

test/test_add_rem_edges.jl

@@ -0,0 +1,17 @@
+using Test
+using NamedGraphs
+using NamedGraphs: add_edges, add_edges!, rem_edges, rem_edges!
+using Graphs
+
+@testset "Adding and Removing Edge Lists" begin
+  g = named_grid((2, 2))
+  rem_edges!(g, [(1, 1) => (1, 2), (1, 1) => (2, 1)])
+  @test !has_edge(g, (1, 1) => (1, 2))
+  @test !has_edge(g, (1, 1) => (2, 1))
+  @test has_edge(g, (1, 2) => (2, 2))
+
+  n = 10
+  g = NamedGraph([(i,) for i in 1:n])
+  add_edges!(g, [(i,) => (i + 1,) for i in 1:(n - 1)])
+  @test is_connected(g)
+end