* @brief Processes the graph, adding all the generated constraints to the query. * Unlike the Python implementation, at the moment assumes there is only a single output. * * @param inputNames The names of the input nodes to start at. * @param terminalNames The names of the output node to end at. * @param query The query in which to store the generated constraints. */
| 757 | * @param query The query in which to store the generated constraints. |
| 758 | */ |
| 759 | void OnnxParser::processGraph() |
| 760 | { |
| 761 | initializeShapeAndConstantMaps(); |
| 762 | for ( String terminalName : _terminalNames ) |
| 763 | { |
| 764 | processNode( terminalName, true ); |
| 765 | } |
| 766 | validateAllInputsAndOutputsFound(); |
| 767 | } |
| 768 | |
| 769 | /** |
| 770 | * @brief Recursively processes the structure of the graph, adding the relevant |