diff --git a/include/aidge/graph/GraphView.hpp b/include/aidge/graph/GraphView.hpp
index 371d1d72ec1745fb4075f490f3081c5900aa671f..cae3beaf4223d6f3232493e7505bc1503abf86cf 100644
--- a/include/aidge/graph/GraphView.hpp
+++ b/include/aidge/graph/GraphView.hpp
@@ -204,9 +204,9 @@ public:
     */
     void setOrderedOutputs(const std::vector<std::pair<NodePtr, IOIndex_t>>& outputs);
 
-    /** @todo i don't understand the description
-     * @brief Get a topological node order for an acyclic walk of the graph
-     * Graph cycles are broken on operator back edges such that resolution on
+    /**
+     * @brief Get a topological node order for an acyclic walk of the graph.
+     * @details Graph cycles are broken on operator back edges such that resolution on
      * single level lattice can be done in a single pass as it is
      * the case generally for static resolution of Tensor shapes/datatypes.
      * When reversed is true, gets a topological order on the reversed graph
@@ -239,12 +239,12 @@ public:
      * @brief List outside data input connections of the GraphView.
      * Data inputs exclude inputs expecting parameters (weights or bias).
      * The vector size is guaranteed to match the number of outside data inputs of the GraphView. If there is
-     * no external connection to a given input, a pair of nullptr and gk_IODefaultIndex is returned. @todo check it, for me it seem every unconnected input will add some nullptr to the list
+     * no external connection to a given input, a pair of nullptr and gk_IODefaultIndex is returned.
      * @return std::vector<std::pair<NodePtr, IOIndex_t>>
      */
     std::vector<std::pair<NodePtr, IOIndex_t>> dataInputs() const;
 
-    /** @todo check it
+    /**
      * @brief List all dataInput connections (within and outside) of the specified GraphView node named "name".
      * Data inputs exclude inputs expecting parameters (weights or bias).
      * @param name Name of the Node.
diff --git a/src/graph/GraphView.cpp b/src/graph/GraphView.cpp
index 626270ce49fbda74e7e58082eb2a6a4a049bbb26..a6d30931b6e7c71b7154d486e46b6d3371deed8d 100644
--- a/src/graph/GraphView.cpp
+++ b/src/graph/GraphView.cpp
@@ -375,7 +375,7 @@ Aidge::IOIndex_t Aidge::GraphView::getNbFreeDataInputs() const {
 
 std::vector<std::pair<std::shared_ptr<Aidge::Node>, Aidge::IOIndex_t>>
 Aidge::GraphView::dataInputs() const {
-  std::vector<std::pair<std::shared_ptr<Node>, IOIndex_t>> res;
+  std::vector<std::pair<std::shared_ptr<Node>, IOIndex_t>> res;  //todo three letters or less variable names should be illegal
 
   for (const std::shared_ptr<Node>& inputNode : inputNodes()) {
     const std::vector<std::pair<std::shared_ptr<Node>, IOIndex_t>> inputNodeinputs =