Bump indexmap from 2.1.0 to 2.2.1

src/dag_algo/mod.rs

@@ -748,12 +748,12 @@ pub fn transitive_reduction(
                     descendants.insert(v, dfs);
                 }
                 for desc in &descendants[&v] {
-                    u_nbrs.remove(&NodeIndex::new(desc.1));
+                    u_nbrs.swap_remove(&NodeIndex::new(desc.1));
                 }
             }
             *check_count.get_mut(&v).unwrap() -= 1;
             if check_count[&v] == 0 {
-                descendants.remove(&v);
+                descendants.swap_remove(&v);
             }
         }
         for v in u_nbrs {

src/digraph.rs

@@ -2520,7 +2520,7 @@ impl PyDiGraph {
         let node_index = self.graph.add_node(obj);
 
         // Sanitize new node index from user input.
-        indices_to_remove.remove(&node_index);
+        indices_to_remove.swap_remove(&node_index);
 
         // Determine edges for new node.
         let mut incoming_edges: Vec<_> = indices_to_remove

src/graph.rs

@@ -1825,7 +1825,7 @@ impl PyGraph {
         let node_index = self.graph.add_node(obj);
 
         // Sanitize new node index from user input.
-        indices_to_remove.remove(&node_index);
+        indices_to_remove.swap_remove(&node_index);
 
         // Determine edges for new node.
         // note: `edges_directed` returns all edges with `i` as

src/steiner_tree.rs

@@ -156,8 +156,8 @@ fn fast_metric_edges(
     let mut paths = DictMap::with_capacity(graph.graph.node_count());
     let mut distance: DictMap<NodeIndex, f64> =
         dijkstra(&graph.graph, dummy, None, cost_fn, Some(&mut paths))?;
-    paths.remove(&dummy);
-    distance.remove(&dummy);
+    paths.swap_remove(&dummy);
+    distance.swap_remove(&dummy);
     graph.graph.remove_node(dummy);
 
     // ``partition[u]`` holds the terminal node closest to node ``u``.