* @brief Clone the GraphView with shared Operators. It is a new GraphView, with cloned Nodes, but the new Nodes refer to the same Operators as the original ones.
* @brief Clone the GraphView with shared Operators. It is a new GraphView, with cloned Nodes, but the new Nodes refer to the same Operators as the original ones.
* @return std::shared_ptr<GraphView>
* @return std::shared_ptr<GraphView> The cloned graphView
* @brief Get the sum of the number of free dataInput connection for all inputNodes of the GraphView object.
* @brief Get the sum of the number of free dataInput connection for all inputNodes of the GraphView object.
* Data inputs exclude inputs expecting parameters (weights or bias).
* Data inputs exclude inputs expecting parameters (weights or bias).
* @return IOIndex_t
* @return IOIndex_t: number of free data inputs
*/
*/
IOIndex_tgetNbFreeDataInputs()const;
IOIndex_tgetNbFreeDataInputs()const;
...
@@ -688,7 +692,7 @@ private:
...
@@ -688,7 +692,7 @@ private:
* @brief Automatically update GraphView inputs/outputs with a new Node, checking if
* @brief Automatically update GraphView inputs/outputs with a new Node, checking if
* it this Node becomes an input/output for the graph and if previous inputs are still
* it this Node becomes an input/output for the graph and if previous inputs are still
* inputs/outputs after adding this node.
* inputs/outputs after adding this node.
* @param nodePtr
* @param nodePtr newNode: recently added Node that needs updating
*/
*/
//@todo see in code comment
//@todo see in code comment
voidupdateInputsOutputsNew(NodePtrnewNode);
voidupdateInputsOutputsNew(NodePtrnewNode);
...
@@ -696,7 +700,7 @@ private:
...
@@ -696,7 +700,7 @@ private:
/**
/**
* @brief Automatically updates GraphView inputs/outputs with a Node removed, checking if this Node was an
* @brief Automatically updates GraphView inputs/outputs with a Node removed, checking if this Node was an
* input/output for the graph and if this node's children and parents become new inputs/outputs for the graph.
* input/output for the graph and if this node's children and parents become new inputs/outputs for the graph.
* @param nodePtr deletedNode the deleted //todo has the node already been delettesd or not yet? if it has been, does it keep its information? if it hasn't, one must ensure to properly delete it afterward to aavoid discrepencies
* @param nodePtr deletedNode: the deleted Node //todo has the node already been delettesd or not yet? if it has been, does it keep its information? if it hasn't, one must ensure to properly delete it afterward to aavoid discrepencies