Default package

Mouse Melon logoGet desktop application:
View/edit binary Protocol Buffers messages

message Graph

graph.proto:73

A graph represents a list of nodes. This is the primary serialization container.

message Node

graph.proto:45

A node represents a single "scope"

Used in: Graph

message NodeRef

graph.proto:36

A NodeRef identifies a doubly-linked connection between neighboring nodes. For example, given the graph: A(0) -> B(1) Node A would contain a NodeRef in its out_ref list: { node_idx: 1, conn_idx: 0 } Node B would contain a backreference in its in_ref list: { node_idx: 0, conn_idx: 0 } In a more complex graph such as: A(0)-\ x-C(2) B(1)-/ A has one output (to C), B has one output (to C), C has two inputs (A & B). Node A contains a single NodeRef in out_ref: { node_idx: 2, conn_idx: 0 } Node B contains a single NodeRef in out_ref: { node_idx: 2, conn_idx: 1 } Node C contains two NodeRef's in in_ref: [ { node_idx: 0, conn_idx: 0 }, { node_idx: 1, conn_idx: 0 } ] The "connection index" of a NodeRef is simply the index of the complementary NodeRef in the target Node. This attribute simplifies graph mutation operations where we need to add and remove nodes efficiently.

Used in: Node