Lift out lambda

Author: stevenfontanella

src/support/graph_traversal.h

@@ -39,19 +39,19 @@ template<typename T, typename SuccessorFunction>
     std::vector<T> stack(roots.begin(), roots.end());
     std::unordered_set<T> visited(roots.begin(), roots.end());
 
+    auto maybePush = [&](const T& t) {
+      if (visited.contains(t)) {
+        return;
+      }
+
+      visited.insert(t);
+      stack.push_back(t);
+    };
+
     while (!stack.empty()) {
       auto curr = std::move(stack.back());
       stack.pop_back();
 
-      auto maybePush = [&](const T& t) {
-        if (visited.contains(t)) {
-          return;
-        }
-
-        visited.insert(t);
-        stack.push_back(t);
-      };
-
       successors(maybePush, curr);
     }