Update changes to G.edges()

2 files changed, 5 insertions, 1 deletions

diff --git a/networkx/algorithms/connectivity/cuts.py b/networkx/algorithms/connectivity/cuts.py
index d8c16d4a..3ebb02aa 100644
--- a/networkx/algorithms/connectivity/cuts.py
+++ b/networkx/algorithms/connectivity/cuts.py
@@ -581,7 +581,7 @@ def minimum_edge_cut(G, s=None, t=None, flow_func=None):
 
         # Initial cutset is all edges of a node with minimum degree
         node = min(G, key=G.degree)
-        min_cut = list(G.edges(node))
+        min_cut = set(G.edges(node))
         # A dominating set is \lambda-covering
         # We need a dominating set with at least two nodes
         for node in G:
diff --git a/networkx/algorithms/hybrid.py b/networkx/algorithms/hybrid.py
index c871c411..5824557d 100644
--- a/networkx/algorithms/hybrid.py
+++ b/networkx/algorithms/hybrid.py
@@ -74,6 +74,10 @@ def kl_connected_subgraph(G, k, l, low_memory=False, same_as_graph=False):
     deleted_some=True # hack to start off the while loop
     while deleted_some:
         deleted_some=False
+        # We use `for edge in list(H.edges()):` instead of
+        # `for edge in H.edges():` because we edit the graph `H` in
+        # the loop. Hence using an iterator will result in
+        # `RuntimeError: dictionary changed size during iteration`
         for edge in list(H.edges()):
             (u,v)=edge
             ### Get copy of graph needed for this search