Get desktop application:
View/edit binary Protocol Buffers messages
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.
Used in:
The source and target fields must have the format of a Node name.
Edge attributes.
List of nodes in the graph.
List of edges in the graph.
Default values of node, metanode and edge attributes.
Graph attributes.
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'.
Used in:
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".
A node attribute is information used by Graph Explorer to style a node.
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.