Method call

ciphercore-base/src/graphs.rs:2971–2973

Adds a node that calls another graph with inputs contained in given nodes. The input graph must be finalized and have as many inputs as the number of provided arguments. For example, let `G` be a graph implementing the function `max(x,0)`, then `call(G, [17]) = max(17, 0)`. # Arguments `graph` - graph with `n` input nodes `arguments` - vector of `n` nodes # Returns New call node # Example

(&self, graph: Graph, arguments: Vec<Node>)

    /// let n6 = g2.call(g1, vec![n5]).unwrap();
    /// ```
    pub fn call(&self, graph: Graph, arguments: Vec<Node>) -> Result<Node> {
        self.add_node(arguments, vec![graph], Operation::Call)
    }

    /// Adds a node that iteratively computes a given finalized graph on the elements of a given vector and updates the state value accordingly.
    ///