diff --git a/src/graph/Node.cpp b/src/graph/Node.cpp
index 05eb37c96a54eb70b5eef62133c3d33aeee1e629..50b8be13c6faac62a8b2aecf1e767e0b83024d3c 100644
--- a/src/graph/Node.cpp
+++ b/src/graph/Node.cpp
@@ -38,30 +38,22 @@ Aidge::Node::Node(std::shared_ptr<Operator> op, const std::string& name)
 ///////////////////////////////////////////////////////
 
 Aidge::Connector Aidge::Node::operator()(const std::vector<Connector>& ctors) {
-    fmt::print("nb ctors = {}\n", ctors.size());
-
     IOIndex_t idx = 0;
     for (const auto& ctor : ctors) {
-        fmt::print("ctor\n");
         // Skip to next possible input idx
         for (; idx < nbInputs() && (inputCategory(idx) != InputCategory::Data && inputCategory(idx) != InputCategory::OptionalData); ++idx) {}
 
-        fmt::print("  skip idx = {}\n", idx);
         AIDGE_ASSERT(idx < nbInputs(), "Too many input connectors ({}) vs available node inputs.", ctors.size());
         AIDGE_ASSERT(input(idx).second == gk_IODefaultIndex, "Data input#{} connection is not free.", idx);
 
         if (ctor.node() != nullptr) {  // ctor must be associated with a node
-            fmt::print("  ctor != nullptr   idx = {}\n", idx);
             ctor.node()->addChild(shared_from_this(), ctor.index(), idx);
         }
         ++idx;
     }
 
-    fmt::print("nb inputs = {}\n", nbInputs());
-
     // Skip to next possible input idx
     for (; idx < nbInputs() && (inputCategory(idx) != InputCategory::Data && inputCategory(idx) != InputCategory::OptionalData); ++idx) {}
-    fmt::print("skip idx = {}\n", idx);
     AIDGE_ASSERT(idx == nbInputs(), "Missing an input connector for Data input#{}", idx);
 
     return Connector(shared_from_this());