Struct Graph 

pub struct Graph {
    pub nodes: Vec<Node>,
    pub root: NodeId,
}

A polynomial expression as a graph in which equal subexpressions share a node.

Children come before their parents, every node is reachable from the root, and the root is the last node. Unary minus is represented as 0 - x.

Fields

nodes: Vec<Node>

The nodes, in dependency order.

root: NodeId

The node holding the value of the whole expression.

Trait Implementations

impl Clone for Graph

fn clone(&self) -> Self

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 Eq for Graph

impl PartialEq for Graph

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Graph