Struct Graph 

pub struct Graph { /* private fields */ }

The computation graph arena.

Implementations

impl Graph

pub fn new() -> Self

pub fn add_node( &mut self, op: OpKind, inputs: SmallVec<[NodeId; 2]>, meta: TensorMeta, ) -> NodeId

Add a node and return its ID.

pub fn add_node_raw( &mut self, op: OpKind, inputs: SmallVec<[NodeId; 2]>, meta: TensorMeta, ) -> NodeId

Add a node without CSE.

pub fn intern_node( &mut self, op: OpKind, inputs: SmallVec<[NodeId; 2]>, meta: TensorMeta, const_payload: Option<&[f32]>, ) -> NodeId

Add a node with CSE. For constants, include a payload hash if available.

pub fn const_payload(&self, id: NodeId) -> Option<&[f32]>

pub fn get(&self, id: NodeId) -> Option<&Node>

Get a node by ID.

pub fn topo_sort(&self, outputs: &[NodeId]) -> Vec<NodeId>

Topological sort of the graph rooted at outputs.

pub fn len(&self) -> usize

Number of nodes.

pub fn is_empty(&self) -> bool

Whether the graph is empty.

Trait Implementations

impl Debug for Graph

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for Graph

fn default() -> Graph

Returns the “default value” for a type.