diff --git a/include/aidge/graph/Node.hpp b/include/aidge/graph/Node.hpp
index d71d095e7f2c0c9bda4781f3efda3fb7954a2ed6..9b16f76d52e1a8d19a225d5ead2d1d47e465fd30 100644
--- a/include/aidge/graph/Node.hpp
+++ b/include/aidge/graph/Node.hpp
@@ -213,10 +213,7 @@ public:
    * @param inID
    * @return std::pair<std::shared_ptr<Node>, IOIndex_t>
    */
-  inline std::pair<NodePtr, IOIndex_t> input(const IOIndex_t inID) const {
-    AIDGE_ASSERT((inID != gk_IODefaultIndex) && (inID < nbInputs()), "Input index out of bound.");
-    return std::pair<NodePtr, IOIndex_t>(mParents[inID], mIdOutParents[inID]);
-  }
+  std::pair<std::shared_ptr<Node>, IOIndex_t> input(const IOIndex_t inID) const;
 
 
   /**
@@ -328,7 +325,7 @@ public:
    * Default to 0.
    * @param otherInId ID of the other Node input to connect to the current Node.
    * Default to the first available data input.
-   * 
+   *
    * @note otherNode shared_ptr is passed by refenrece in order to be able to detect
    * possible dangling connection situations in debug using ref counting.
    */
@@ -509,7 +506,7 @@ private:
    * @param otherNode
    * @param outId
    * @param otherInId
-   * 
+   *
    * @note otherNode shared_ptr is passed by refenrece in order to be able to detect
    * possible dangling connection situations in debug using ref counting.
    */
diff --git a/include/aidge/utils/Directories.hpp b/include/aidge/utils/Directories.hpp
index 783783946ff5bdae5214cc41f6a1f029fae6e09c..c42280a6d67cfc86c64013b236690bf84f985f66 100644
--- a/include/aidge/utils/Directories.hpp
+++ b/include/aidge/utils/Directories.hpp
@@ -11,11 +11,10 @@
 #ifndef AIDGE_DIRECTORIES_H_
 #define AIDGE_DIRECTORIES_H_
 
-#include <algorithm>
+#include <algorithm>  // std::replace_if
 #include <errno.h>
 #include <string>
 // #include <string_view> available in c++-17
-#include <vector>
 
 #include <fmt/core.h>
 #include <fmt/format.h>
diff --git a/src/graph/Node.cpp b/src/graph/Node.cpp
index 1c8585d1d1f26341724486a16d0678d92f759146..0dec30c2f2f2ffcb0f83740c863d46d7169d2f06 100644
--- a/src/graph/Node.cpp
+++ b/src/graph/Node.cpp
@@ -173,6 +173,12 @@ std::vector<std::pair<std::shared_ptr<Aidge::Node>, Aidge::IOIndex_t>> Aidge::No
     return res;
 }
 
+std::pair<std::shared_ptr<Aidge::Node>, Aidge::IOIndex_t> Aidge::Node::input(const Aidge::IOIndex_t inID) const {
+    // nbInputs already < gk_IODefaultIndex
+    AIDGE_ASSERT((inID < nbInputs()), "Input index out of bound.");
+    return std::pair<NodePtr, IOIndex_t>(mParents[inID], mIdOutParents[inID]);
+}
+
 // void Aidge::Node::setInput(const Aidge::IOIndex_t idx, const std::shared_ptr<Aidge::Tensor>
 // tensor) {
 //     assert(((idx != gk_IODefaultIndex) && (idx < nbInputs())) && "Parent index out of bound.");