From 9169029629db60fdb16049a2b8f9070184b27c71 Mon Sep 17 00:00:00 2001
From: Bob Luppes <bobluppes@gmail.com>
Date: Thu, 28 Sep 2023 20:56:56 +0200
Subject: [PATCH] remove dead code

---
 include/graaflib/algorithm/minimum_spanning_tree.tpp | 6 ------
 1 file changed, 6 deletions(-)

diff --git a/include/graaflib/algorithm/minimum_spanning_tree.tpp b/include/graaflib/algorithm/minimum_spanning_tree.tpp
index 03230b95..ad79a1e4 100644
--- a/include/graaflib/algorithm/minimum_spanning_tree.tpp
+++ b/include/graaflib/algorithm/minimum_spanning_tree.tpp
@@ -144,12 +144,6 @@ std::optional<std::vector<edge_id_t>> prim_minimum_spanning_tree(
     fringe_vertices.insert(mst_edge.second);
   }
 
-  // If our tree does not cover all vertices in the graph it is not a spanning
-  // tree
-  if (fringe_vertices.size() != graph.vertex_count()) {
-    return std::nullopt;
-  }
-
   return edges_in_mst;
 }