Documentation
¶
Overview ¶
Package proto is a generated protocol buffer package.
It is generated from these files:
tensorflow/contrib/tensorboard/graph_explorer/proto/graph_explorer.proto
It has these top-level messages:
Node Edge Graph
Index ¶
- type Edge
- type Graph
- func (*Graph) Descriptor() ([]byte, []int)
- func (m *Graph) GetEdge() []*Edge
- func (m *Graph) GetEdgeAttr() map[string]string
- func (m *Graph) GetGraphAttr() map[string]string
- func (m *Graph) GetMetanodeAttr() map[string]string
- func (m *Graph) GetNode() []*Node
- func (m *Graph) GetNodeAttr() map[string]string
- func (*Graph) ProtoMessage()
- func (m *Graph) Reset()
- func (m *Graph) String() string
- type Node
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type Edge ¶
type Edge struct { // The source and target fields must have the format of a Node name. Source string `protobuf:"bytes,1,opt,name=source" json:"source,omitempty"` Target string `protobuf:"bytes,2,opt,name=target" json:"target,omitempty"` // Edge attributes. EdgeAttr map[string]string `` /* 152-byte string literal not displayed */ }
An edge consists of a source and a target node, specified by their identifiers. An edge has attributes and data that are similar to node attributes and node data. Edges do not form a hierarchy so there are no metanode attributes.
func (*Edge) Descriptor ¶
func (*Edge) GetEdgeAttr ¶
func (*Edge) ProtoMessage ¶
func (*Edge) ProtoMessage()
type Graph ¶
type Graph struct { // List of nodes in the graph. Node []*Node `protobuf:"bytes,1,rep,name=node" json:"node,omitempty"` // List of edges in the graph. Edge []*Edge `protobuf:"bytes,2,rep,name=edge" json:"edge,omitempty"` // Default values of node, metanode and edge attributes. NodeAttr map[string]string `` /* 152-byte string literal not displayed */ MetanodeAttr map[string]string `` /* 164-byte string literal not displayed */ EdgeAttr map[string]string `` /* 152-byte string literal not displayed */ // Graph attributes. GraphAttr map[string]string `` /* 155-byte string literal not displayed */ }
func (*Graph) Descriptor ¶
func (*Graph) GetEdgeAttr ¶
func (*Graph) GetGraphAttr ¶
func (*Graph) GetMetanodeAttr ¶
func (*Graph) GetNodeAttr ¶
func (*Graph) ProtoMessage ¶
func (*Graph) ProtoMessage()
type Node ¶
type Node struct { // The identifier of a node is a sequence of strings separated by '/'. The // identifier provides a unique name for a node and defines its hierarchical // relation to other nodes. If no label is provided the last part of the // identifier is used as a label. // // Example: In the graph below, metanodes are written with square brackets and // leaf nodes with parentheses. The metanode 'node1' contains the leaf node // 'node4' and the metanode 'node2', which contains the leaf node 'node3'. // // [node1 [node2 (node3)] (node4)] // // The identifiers for these nodes are: "node1", "node1/node2", // "node1/node2/node3", and "node1/node4". Name string `protobuf:"bytes,1,opt,name=name" json:"name,omitempty"` // A node attribute is information used by Graph Explorer to style a node. NodeAttr map[string]string `` /* 152-byte string literal not displayed */ // A metanode attribute is one that is inherited by all nodes inside the // current metanode. If an attribute applies only to the current node and // should not be inherited, it should be specified as a node attribute. MetanodeAttr map[string]string `` /* 164-byte string literal not displayed */ }
There are two types of nodes. A 'metanode' contains other nodes and a 'leaf node' has no internal structure. The metanode containment relationship is acyclic, meaning that if a metanode 'A' contains the metanode 'B', then 'B' cannot contain 'A'.
func (*Node) Descriptor ¶
func (*Node) GetMetanodeAttr ¶
func (*Node) GetNodeAttr ¶
func (*Node) ProtoMessage ¶
func (*Node) ProtoMessage()
Click to show internal directories.
Click to hide internal directories.