1 files changed, 7 insertions, 9 deletions
diff --git a/test/gtest/topological-orders.cpp b/test/gtest/topological-orders.cpp
index ba370123d..41e1df483 100644
--- a/test/gtest/topological-orders.cpp
+++ b/test/gtest/topological-orders.cpp
@@ -102,14 +102,13 @@ TEST(TopologicalOrdersTest, Diamond) {
 
 TEST(MinTopologicalSortTest, Empty) {
   Graph graph(0);
-  EXPECT_EQ(*MinTopologicalSort(graph), std::vector<size_t>{});
+  EXPECT_EQ(TopologicalSort::minSort(graph), std::vector<size_t>{});
 }
 
 TEST(MinTopologicalSortTest, Unconstrained) {
   Graph graph(3);
-  MinTopologicalSort order(graph);
   std::vector<size_t> expected{0, 1, 2};
-  EXPECT_EQ(*MinTopologicalSort(graph), expected);
+  EXPECT_EQ(TopologicalSort::minSort(graph), expected);
 }
 
 TEST(MinTopologicalSortTest, Reversed) {
@@ -117,7 +116,7 @@ TEST(MinTopologicalSortTest, Reversed) {
   graph[2].push_back(1);
   graph[1].push_back(0);
   std::vector<size_t> expected{2, 1, 0};
-  EXPECT_EQ(*MinTopologicalSort(graph), expected);
+  EXPECT_EQ(TopologicalSort::minSort(graph), expected);
 }
 
 TEST(MinTopologicalSortTest, OneBeforeZero) {
@@ -125,7 +124,7 @@ TEST(MinTopologicalSortTest, OneBeforeZero) {
   graph[1].push_back(0);
   // 2 last because it is greater than 1 and 0
   std::vector<size_t> expected{1, 0, 2};
-  EXPECT_EQ(*MinTopologicalSort(graph), expected);
+  EXPECT_EQ(TopologicalSort::minSort(graph), expected);
 }
 
 TEST(MinTopologicalSortTest, TwoBeforeOne) {
@@ -133,7 +132,7 @@ TEST(MinTopologicalSortTest, TwoBeforeOne) {
   graph[2].push_back(1);
   // 0 first because it is less than 2 and 1
   std::vector<size_t> expected{0, 2, 1};
-  EXPECT_EQ(*MinTopologicalSort(graph), expected);
+  EXPECT_EQ(TopologicalSort::minSort(graph), expected);
 }
 
 TEST(MinTopologicalSortTest, TwoBeforeZero) {
@@ -141,7 +140,7 @@ TEST(MinTopologicalSortTest, TwoBeforeZero) {
   graph[2].push_back(0);
   // 1 first because it is less than 2 and zero is not eligible.
   std::vector<size_t> expected{1, 2, 0};
-  EXPECT_EQ(*MinTopologicalSort(graph), expected);
+  EXPECT_EQ(TopologicalSort::minSort(graph), expected);
 }
 
 TEST(MinTopologicalSortTest, Strings) {
@@ -151,6 +150,5 @@ TEST(MinTopologicalSortTest, Strings) {
     {"dog", {}},
     {"mammal", {"cat", "dog"}}};
   std::vector<std::string> expected{"animal", "mammal", "cat", "dog"};
-  EXPECT_EQ(*MinTopologicalSortOf<std::string>(graph.begin(), graph.end()),
-            expected);
+  EXPECT_EQ(TopologicalSort::minSortOf(graph.begin(), graph.end()), expected);
 }