Function TEST

src/colmap/math/spanning_tree_test.cc:53–64

}

TEST(SpanningTree, Nominal) {
  // Triangle: edges with weights 1, 2, 3.
  // Max spanning tree uses edges 2+3=5, min uses 1+2=3.
  const std::vector<std::pair<int, int>> edges = {{0, 1}, {1, 2}, {0, 2}};
  const std::vector<float> weights = {1.0f, 2.0f, 3.0f};

  const SpanningTree max_tree = ComputeMaximumSpanningTree(3, edges, weights);
  const SpanningTree min_tree = ComputeMinimumSpanningTree(3, edges, weights);

  EXPECT_EQ(ComputeTreeWeight(max_tree, edges, weights), 5.0f);
  EXPECT_EQ(ComputeTreeWeight(min_tree, edges, weights), 3.0f);
}

TEST(SpanningTree, DisconnectedGraph) {
  // Two components: {0,1} and {2,3}. Only component containing root is