Struct PirGraph 

pub struct PirGraph { /* private fields */ }

Arena-backed directed acyclic graph of probabilistic expressions.

Implementations

impl PirGraph

pub fn new() -> Self

Creates an empty graph.

pub fn len(&self) -> usize

Returns the number of nodes in the graph.

pub fn is_empty(&self) -> bool

Returns whether the graph contains no nodes.

pub fn nodes(&self) -> &[PirNode]

Returns all nodes in identifier order.

pub fn node(&self, id: PirNodeId) -> Option<&PirNode>

Returns a node by identifier, or None when the identifier is invalid.

pub fn const_true(&mut self) -> PirNodeId

Appends a true constant and returns its identifier.

pub fn const_false(&mut self) -> PirNodeId

Appends a false constant and returns its identifier.

pub fn lit(&mut self, leaf: LeafId) -> PirNodeId

Appends a positive leaf literal and returns its node identifier.

pub fn neg_lit(&mut self, leaf: LeafId) -> PirNodeId

Appends a negated leaf literal and returns its node identifier.

pub fn and(&mut self, children: Vec<PirNodeId>) -> PirNodeId

Appends a conjunction and returns its node identifier.

pub fn or(&mut self, children: Vec<PirNodeId>) -> PirNodeId

Appends a disjunction and returns its node identifier.

pub fn decision( &mut self, var: ChoiceVarId, child_false: PirNodeId, child_true: PirNodeId, ) -> PirNodeId

Appends a binary choice node and returns its identifier.

pub fn levelize(&self, roots: &[PirNodeId]) -> Result<Vec<Vec<PirNodeId>>>

Groups nodes reachable from roots into dependency-first evaluation levels.

Trait Implementations

impl Clone for PirGraph

fn clone(&self) -> PirGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PirGraph

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

Formats the value using the given formatter.

impl Default for PirGraph

fn default() -> PirGraph

Returns the “default value” for a type.