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> 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; }