diff --git a/include/aidge/graph/GraphView.hpp b/include/aidge/graph/GraphView.hpp
index edd91ef0697e0d7f307ae4881cd71e8d270fa819..c18d91c2e67cc95e3b5aa653712dfc6dacda3693 100644
--- a/include/aidge/graph/GraphView.hpp
+++ b/include/aidge/graph/GraphView.hpp
@@ -394,7 +394,7 @@ public:
     std::pair<std::vector<NodePtr>, size_t> getRankedNodes() const;
 
     /**
-    // todo see comment in code
+    // todo comment is in code
      * Get the nodes name according to the GraphView nodes ranking.
      * @param format The formatting string to be used with fmt::format().
      * @details The usable positional arguments are the following:
diff --git a/src/graph/GraphView.cpp b/src/graph/GraphView.cpp
index a6d30931b6e7c71b7154d486e46b6d3371deed8d..8440f22e84735b02b7c1d96ffd335c38d7697a8b 100644
--- a/src/graph/GraphView.cpp
+++ b/src/graph/GraphView.cpp
@@ -762,7 +762,7 @@ std::map<Aidge::NodePtr, std::string> Aidge::GraphView::getRankedNodesName(const
     std::map<std::string, size_t>::iterator it;
     std::tie(it, std::ignore) = typeRank.insert(std::make_pair(rankedNode->type(), 0));
 
-    const auto name = (markNonUnicity && rank < rankedNodes.second)  //if todo logic doesn't match description, to be checked
+    const auto name = (markNonUnicity && rank < rankedNodes.second)  //if todo logic doesn't match description, to be checked, i'd say > and swap ? and :
       ? fmt::format(format, rankedNode->name(), rankedNode->type(), rank, it->second)  //then
       : fmt::format(format, rankedNode->name(), rankedNode->type(), fmt::format("?{}", rank), fmt::format("?{}", it->second));  //else
     rankedNodesName.insert(std::make_pair(rankedNode, name));