Add new assert helper function for GraphTopologyDeletion tests

src/testing/graph_topology_deletion_testing.rs

@@ -354,25 +354,7 @@ where
             .iter()
             .filter_map(|x| (x.edge != edges[2].0).then_some(x.edge))
             .collect();
-        assert_eq!(
-            graph.incident_edges(vertices[i]).count(),
-            expected.len(),
-            "unexpected incident edge count for vertex {:?} after delete",
-            vertices[i]
-        );
-        for e in graph.incident_edges(vertices[i]) {
-            let pos = expected.iter().position(|f| *f == e).expect(&format!(
-                "unexpected incident edge {e:?} of vertex {:?} after delete",
-                vertices[i]
-            ));
-            expected.swap_remove(pos);
-        }
-        assert!(
-            expected.is_empty(),
-            "expected incident edges {:?} of vertex {:?} not matched after delete",
-            expected,
-            vertices[i]
-        );
+        assert_incident_edges_after_delete(&graph, vertices[i], &mut expected);
     }
 }
 
@@ -388,25 +370,7 @@ where
             .iter()
             .filter_map(|x| (x.vertex != vertices[2]).then_some(x.edge))
             .collect();
-        assert_eq!(
-            graph.incident_edges(vertices[i]).count(),
-            expected.len(),
-            "unexpected incident edge count for vertex {:?} after delete",
-            vertices[i]
-        );
-        for e in graph.incident_edges(vertices[i]) {
-            let pos = expected.iter().position(|f| *f == e).expect(&format!(
-                "unexpected incident edge {e:?} of vertex {:?} after delete",
-                vertices[i]
-            ));
-            expected.swap_remove(pos);
-        }
-        assert!(
-            expected.is_empty(),
-            "expected incident edges {:?} of vertex {:?} not matched after delete",
-            expected,
-            vertices[i]
-        );
+        assert_incident_edges_after_delete(&graph, vertices[i], &mut expected);
     }
 }
 
@@ -536,3 +500,32 @@ fn assert_vertex_incidence_cursor<G: GraphTopology>(
         v
     );
 }
+
+fn assert_incident_edges_after_delete<G: GraphTopology>(
+    graph: &G,
+    v: G::Vertex,
+    expected: &mut Vec<G::Edge>,
+) where
+    G::Vertex: Debug,
+    G::Edge: Debug,
+{
+    assert_eq!(
+        graph.incident_edges(v).count(),
+        expected.len(),
+        "unexpected incident edge count for vertex {:?} after delete",
+        v
+    );
+    for e in graph.incident_edges(v) {
+        let pos = expected.iter().position(|f| *f == e).expect(&format!(
+            "unexpected incident edge {e:?} of vertex {:?} after delete",
+            v
+        ));
+        expected.swap_remove(pos);
+    }
+    assert!(
+        expected.is_empty(),
+        "expected incident edges {:?} of vertex {:?} not matched after delete",
+        expected,
+        v
+    );
+}