diff --git a/include/aidge/graph/GraphView.hpp b/include/aidge/graph/GraphView.hpp
index 5ec62c50a17c2141c71dc36f4824767873adf200..371d1d72ec1745fb4075f490f3081c5900aa671f 100644
--- a/include/aidge/graph/GraphView.hpp
+++ b/include/aidge/graph/GraphView.hpp
@@ -188,9 +188,20 @@ public:
     /** @brief Assess if the given Node is an output Node of the GraphView object. */
     bool isOutputNode(const NodePtr& nodePtr) const;
 
-    /** @todo
+    /**
+    * @brief Orders the inputs of the GraphView
+    * @details The Inputs will be ordered in the same order as they come in the std::vector.
+    * Inputs missing from this vector will then be added as per their previous order.
+    * @param std::vector<std::pair<NodePtr, IOIndex_t>>& inputs set of inputs in the wanted order
     */
     void setOrderedInputs(const std::vector<std::pair<NodePtr, IOIndex_t>>& inputs);
+
+    /**
+    * @brief Orders the outputs of the GraphView
+    * @details The outputs will be ordered in the same order as they come in the std::vector.
+    * Outputs missing from this vector will then be added as per their previous order.
+    * @param std::vector<std::pair<NodePtr, IOIndex_t>>& outputs set of outputs in the wanted order
+    */
     void setOrderedOutputs(const std::vector<std::pair<NodePtr, IOIndex_t>>& outputs);
 
     /** @todo i don't understand the description