repeated .onnx.SparseTensorProto sparse_initializer = 15;

repeated .onnx.SparseTensorProto sparse_tensors = 23;

repeated bytes string_data = 6;

repeated bytes strings = 9;

repeated .onnx.TensorProto tensors = 10;

repeated .onnx.TrainingInfoProto training_info = 20;

repeated .onnx.TypeProto type_protos = 15;

repeated uint64 uint64_data = 11 [packed = true];

repeated .onnx.StringStringEntryProto update_binding = 4;

repeated .onnx.ValueInfoProto value_info = 13;

True if all element values are known.

* Allocate memory for N items using the standard allocator. */

// Solve optimal solution for assignment problem using Munkres algorithm, also known as Hungarian Algorithm. //

/