diff --git a/include/onnxruntime/core/graph/graph_nodes.h b/include/onnxruntime/core/graph/graph_nodes.h
index 422fe9538e..aec603f794 100644
--- a/include/onnxruntime/core/graph/graph_nodes.h
+++ b/include/onnxruntime/core/graph/graph_nodes.h
@@ -100,7 +100,7 @@ class ValidNodes {
     using const_reference = const T&;
 
     /** Construct a NodeInterator and move to the first valid node. */
-    NodeIterator<TIterator>(const TIterator current, const TIterator end, const NodeFilterFunc& filter_fn) noexcept
+    NodeIterator(const TIterator current, const TIterator end, const NodeFilterFunc& filter_fn) noexcept
         : current_{current}, end_{end}, apply_filter_{filter_fn != nullptr}, filter_func_{&filter_fn} {
       // skip to next valid node, stopping at end if none are found
       while (current_ < end && (*current_ == nullptr ||
diff --git a/onnxruntime/test/providers/cpu/controlflow/loop_test.cc b/onnxruntime/test/providers/cpu/controlflow/loop_test.cc
index b058e9a16c..3cf147e997 100644
--- a/onnxruntime/test/providers/cpu/controlflow/loop_test.cc
+++ b/onnxruntime/test/providers/cpu/controlflow/loop_test.cc
@@ -2,6 +2,7 @@
 // Licensed under the MIT License.
 
 #include <future>
+#include <thread>
 #include "gtest/gtest.h"
 #include "gmock/gmock.h"