diff --git a/include/aidge/graph/GraphView.hpp b/include/aidge/graph/GraphView.hpp
index d3b0224633835e8677b8e50ac34359a559f5dfa6..a8c61ac1d1cf0827358ebf1facc774a18b98185d 100644
--- a/include/aidge/graph/GraphView.hpp
+++ b/include/aidge/graph/GraphView.hpp
@@ -98,6 +98,11 @@ public:
      */
     void save(std::string path, bool verbose = false, bool showProducers = true) const;
 
+    /**
+     * Check that a node is in the current GraphView.
+     * @param nodePtr Node to check
+     * @return bool True is nodePtr belongs to the GraphView.
+    */
     inline bool inView(NodePtr nodePtr) const {
         return mNodes.find(nodePtr) != mNodes.end();
     }
diff --git a/src/graph/GraphView.cpp b/src/graph/GraphView.cpp
index a5bc01878b7dbf056b44e15b916d616d58741f35..57e3cc911af049b7644a25f1978ae7137ca21fdf 100644
--- a/src/graph/GraphView.cpp
+++ b/src/graph/GraphView.cpp
@@ -401,6 +401,8 @@ void Aidge::GraphView::setInputId(Aidge::IOIndex_t /*inID*/,
 }
 
 void Aidge::GraphView::add(std::shared_ptr<Node> node, bool includeLearnableParam) {
+  AIDGE_ASSERT(node != nullptr, "Trying to add non-existant node!");
+
   // first node to be added to the graph is the root node by default
   if (mRootNode == nullptr) {
     mRootNode = node;
@@ -442,7 +444,7 @@ std::pair<std::vector<Aidge::NodePtr>, size_t> Aidge::GraphView::getRankedNodes(
 
     for (auto childs : curNode->getOrderedChildren()) {
       for (auto child : childs) {
-        if (nodesToRank.find(child) != nodesToRank.end()) {
+        if (child != nullptr && nodesToRank.find(child) != nodesToRank.end()) {
           rankedNodes.push_back(child);
           nodesToRank.erase(child);
         }
@@ -450,7 +452,7 @@ std::pair<std::vector<Aidge::NodePtr>, size_t> Aidge::GraphView::getRankedNodes(
     }
 
     for (auto parent : curNode->getParents()) {
-      if (nodesToRank.find(parent) != nodesToRank.end()) {
+      if (parent != nullptr && nodesToRank.find(parent) != nodesToRank.end()) {
         rankedNodes.push_back(parent);
         nodesToRank.erase(parent);
       }
@@ -538,7 +540,7 @@ bool Aidge::GraphView::add(std::set<std::shared_ptr<Node>> otherNodes, bool incl
 
     for (auto childs : curNode->getOrderedChildren()) {
       for (auto child : childs) {
-        if (nodesToRank.find(child) != nodesToRank.end()) {
+        if (child != nullptr && nodesToRank.find(child) != nodesToRank.end()) {
           rankedNodes.push_back(child);
           nodesToRank.erase(child);
 
@@ -551,7 +553,7 @@ bool Aidge::GraphView::add(std::set<std::shared_ptr<Node>> otherNodes, bool incl
     }
 
     for (auto parent : curNode->getParents()) {
-      if (nodesToRank.find(parent) != nodesToRank.end()) {
+      if (parent != nullptr && nodesToRank.find(parent) != nodesToRank.end()) {
         rankedNodes.push_back(parent);
         nodesToRank.erase(parent);
 
diff --git a/src/operator/OperatorTensor.cpp b/src/operator/OperatorTensor.cpp
index 262f9078843b78512d10c7e3e4fedf4e5c58fdcb..d3593cc613b926f28720e0f366aedf6e37190f59 100644
--- a/src/operator/OperatorTensor.cpp
+++ b/src/operator/OperatorTensor.cpp
@@ -152,6 +152,7 @@ void Aidge::OperatorTensor::setDataType(const DataType& dataType) const {
     }
 
     for (IOIndex_t i = nbData(); i < nbInputs(); ++i) {
+        AIDGE_ASSERT(getInput(i) != nullptr, "Missing input#{} for operator {}", i, type());
         getInput(i)->setDataType(dataType);
     }
 }
\ No newline at end of file