Graphs
A graph defines the computational logic of a model and is comprised of a parameterized list of nodes that form a directed acyclic graph based on their inputs and outputs. This is the equivalent of the "network" or "graph" in many deep learning frameworks.
Value parameters
- docString
-
A human-readable documentation for this graph. Markdown is allowed.
- initializer
-
A list of named tensor values, used to specify constant inputs of the graph. Each initializer (both TensorProto as well SparseTensorProto) MUST have a name. The name MUST be unique across both initializer and sparse_initializer, but the name MAY also appear in the input list.
- input
-
The inputs and outputs of the graph.
- name
-
The name of the graph. namespace Graph
- node
-
The nodes in the graph, sorted topologically.
- quantizationAnnotation
-
This field carries information to indicate the mapping among a tensor and its quantization parameter tensors. For example: For tensor 'a', it may have {'SCALE_TENSOR', 'a_scale'} and {'ZERO_POINT_TENSOR', 'a_zero_point'} annotated, which means, tensor 'a_scale' and tensor 'a_zero_point' are scale and zero point of tensor 'a' in the model.
- sparseInitializer
-
Initializers (see above) stored in sparse format.
- valueInfo
-
Information for the values in the graph. The ValueInfoProto.name's must be distinct. It is optional for a value to appear in value_info list.
Attributes
- Companion
- object
- Graph
-
- Supertypes
-
trait Updatable[GraphProto]trait GeneratedMessagetrait Serializabletrait Producttrait Equalsclass Objecttrait Matchableclass Any