compile(inputs, outputs) {
          const executionInfo = getExecutionSubgraph(inputs, outputs, this.weightMap, this._initNodes);
          const { missingInputs, dynamicNode, syncInputs } = executionInfo;
          if (dynamicNode != null) {
              throw new Error(`This execution contains the node '${dynamicNode.name}', which has ` +
                  `the dynamic op '${dynamicNode.op}'. Please use ` +
                  `model.executeAsync() instead. Alternatively, to avoid the ` +
                  `dynamic ops, specify the inputs [${syncInputs}]`);
          }
          if (missingInputs.length > 0) {
              const outNames = outputs.map(n => n.name);
              const inNames = Object.keys(inputs);
              throw new Error(`Cannot compute the outputs [${outNames}] from the provided inputs ` +
                  `[${inNames}]. Missing the following inputs: [${missingInputs}]`);
          }
          return getNodesInTopologicalOrder(this.graph, this.weightMap, executionInfo);
      }
/**
       * Compiles the inference graph and returns the minimal set of nodes that are
       * required for execution, in the correct execution order.
       */
Compiles the inference graph and returns the minimal set of nodes that are
required for execution, in the correct execution order.
Compiles the inference graph and returns the minimal set of nodes that are required for execution in the correct execution order .
compile(inputs, outputs) {
          const executionInfo = getExecutionSubgraph(inputs, outputs, this.weightMap, this._initNodes);
          const { missingInputs, dynamicNode, syncInputs } = executionInfo;
          if (dynamicNode != null) {
              throw new Error(`This execution contains the node '${dynamicNode.name}', which has ` +
                  `the dynamic op '${dynamicNode.op}'. Please use ` +
                  `model.executeAsync() instead. Alternatively, to avoid the ` +
                  `dynamic ops, specify the inputs [${syncInputs}]`);
          }
          if (missingInputs.length > 0) {
              const outNames = outputs.map(n => n.name);
              const inNames = Object.keys(inputs);
              throw new Error(`Cannot compute the outputs [${outNames}] from the provided inputs ` +
                  `[${inNames}]. Missing the following inputs: [${missingInputs}]`);
          }
          return getNodesInTopologicalOrder(this.graph, this.weightMap, executionInfo);
      }
compile ( inputs , outputs ) { const executionInfo = getExecutionSubgraph ( inputs , outputs , this . weightMap , this . _initNodes ) ; const { missingInputs , dynamicNode , syncInputs } = executionInfo ; if ( dynamicNode != null ) { throw new Error ( ` ${ dynamicNode . name } ` + ` ${ dynamicNode . op } ` + ` ` + ` ${ syncInputs } ` ) ; } if ( missingInputs . length > 0 ) { const outNames = outputs . map ( n => n . name ) ; const inNames = Object . keys ( inputs ) ; throw new Error ( ` ${ outNames } ` + ` ${ inNames } ${ missingInputs } ` ) ; } return getNodesInTopologicalOrder ( this . graph , this . weightMap , executionInfo ) ; }
Compiles the inference graph and returns the minimal set of nodes that are
 required for execution, in the correct execution order.
Compiles the inference graph and returns the minimal set of nodes that are required for execution in the correct execution order .