diff --git a/include/aidge/graph/Node.hpp b/include/aidge/graph/Node.hpp
index de2a7b6aae5357d9a1304ec2b718a475abc1ea43..c9004a8e4a5a34c9092a80f9044a5a343b5b7ad7 100644
--- a/include/aidge/graph/Node.hpp
+++ b/include/aidge/graph/Node.hpp
@@ -456,7 +456,16 @@ private:
    * @param inId index for adding the parent.
    */
   void addParent(const NodePtr otherNode, const IOIndex_t inId);
+
+  /**
+   * @brief operator<< overload to ease print & debug of nodes
+   * @param[inout] ostream to print to 
+   * @param[in] n node to print
+   */
+  friend std::ostream& operator << (std::ostream& os, Node& n); 
 };
+
 } // namespace Aidge
 
+
 #endif /* AIDGE_CORE_GRAPH_NODE_H_ */
diff --git a/src/graph/Node.cpp b/src/graph/Node.cpp
index 5d210144e2faa122416186734c52b67f1a0f8281..c84e19df9fe65b5afddf250d1cec55f148797481 100644
--- a/src/graph/Node.cpp
+++ b/src/graph/Node.cpp
@@ -382,6 +382,26 @@ std::set<Aidge::NodePtr> Aidge::Node::getNodeDelta(int delta, std::set<Aidge::No
 
     return out;
 }
+
+namespace Aidge {
+std::ostream& operator << (std::ostream& os, Aidge::Node& n) {
+    using namespace std;
+    os << "Node :\tName :\t\"" << n.name() << "\"\tType : \"" << n.getOperator()->type()<< "\"\tIN/OUTputs : "<< n.nbInputs() <<"/"<< n.nbOutputs() <<endl; 
+    os << "\tParents :\t" ;
+    for (const auto & p : n.getParents())
+    {
+        os << "\"" <<p->name() << "\"\t"; 
+    }
+    os << endl;
+    os << "\tChildren :\t" ;
+    for (const auto & c : n.getChildren())
+    {
+        os << "\"" << c->name() << "\"\t"; 
+    }
+    os << endl;
+    return os;
+}
+}
 /////////////////////////////////////////////////////////////////////////////////////////////
 // private