From 0486e91d1b446e001d51777627726ac7ef45bba7 Mon Sep 17 00:00:00 2001
From: Alec Edgington <alec.edgington@cambridgequantum.com>
Date: Wed, 5 Jan 2022 10:43:25 +0000
Subject: [PATCH] Extend unit test to cover directed graphs as well and add a
 couple of checks.

---
 test/delete_edge.cpp | 12 +++++++++++-
 1 file changed, 11 insertions(+), 1 deletion(-)

diff --git a/test/delete_edge.cpp b/test/delete_edge.cpp
index 8d29329c..2abbfc76 100644
--- a/test/delete_edge.cpp
+++ b/test/delete_edge.cpp
@@ -56,12 +56,22 @@ int main(int argc, char* argv[])
     BOOST_TEST(m_graph[ed1] == EDGE_VAL);
 
     // https://github.com/boostorg/graph/issues/268
+    // 1. Undirected:
     {
         boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS> g;
         boost::add_edge(2, 0, g);
         boost::remove_vertex(1, g);
+        BOOST_TEST(num_vertices(g) == 2);
+        BOOST_TEST(num_edges(g) == 1);
+    }
+    // 2. Directed:
+    {
+        boost::adjacency_list<boost::setS, boost::vecS, boost::directedS> g;
+        boost::add_edge(2, 0, g);
+        boost::remove_vertex(1, g);
+        BOOST_TEST(num_vertices(g) == 2);
+        BOOST_TEST(num_edges(g) == 1);
     }
-
 
     return boost::report_errors();
 }