Struct Graph 

pub struct Graph {
    pub inputs: Vec<u16>,
    pub nodes: Vec<Node>,
    pub outputs: Vec<u16>,
}

The complete TØR-G graph (DAG).

A graph consists of:

• Input declarations (external boolean values)
• Node definitions (boolean operations on sources)
• Output declarations (which node IDs are graph outputs)

The graph is guaranteed to be a DAG because nodes can only reference previously-defined IDs.

Fields

inputs: Vec<u16>

Declared input IDs (in declaration order).

nodes: Vec<Node>

Node definitions (in topological order).

outputs: Vec<u16>

Output IDs (in declaration order).

Implementations

impl Graph

pub fn new() -> Self

Create an empty graph.

pub fn node_count(&self) -> usize

Number of nodes (excluding inputs).

pub fn input_count(&self) -> usize

Number of declared inputs.

pub fn output_count(&self) -> usize

Number of declared outputs.

pub fn depth(&self) -> usize

Calculate graph depth (longest path from input to output).

Depth is defined as the maximum number of node hops from any input to any output. A graph with only inputs feeding directly to outputs has depth 1.

pub fn is_input(&self, id: u16) -> bool

Check if an ID is a declared input.

pub fn get_node(&self, id: u16) -> Option<&Node>

Get a node by its ID.

Trait Implementations

impl Clone for Graph

fn clone(&self) -> Graph

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

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.

impl PartialEq for Graph

fn eq(&self, other: &Graph) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for Graph

impl StructuralPartialEq for Graph