Struct ChoiceGraph 

pub struct ChoiceGraph {
    pub nodes: Vec<ChoiceGraphNode>,
    pub edges: Vec<(usize, usize)>,
    pub start_idx: usize,
    pub end_idx: usize,
}

Validated Choice Graph (paper Definition 1).

Fields

nodes: Vec<ChoiceGraphNode>

edges: Vec<(usize, usize)>

start_idx: usize

end_idx: usize

Implementations

impl ChoiceGraph

pub fn new( nodes: Vec<ChoiceGraphNode>, edges: Vec<(usize, usize)>, ) -> Result<Self, ChoiceGraphError>

Construct and validate per Definition 1.

Auto-discovers start_idx / end_idx from the nodes vec.

pub fn successors(&self, node_idx: usize) -> Vec<usize>

pub fn predecessors(&self, node_idx: usize) -> Vec<usize>

pub fn has_empty_path(&self) -> bool

True iff there is a direct Start→End edge (the empty path).

Trait Implementations

impl Clone for ChoiceGraph

fn clone(&self) -> ChoiceGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ChoiceGraph

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for ChoiceGraph

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for ChoiceGraph

fn eq(&self, other: &ChoiceGraph) -> 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 Serialize for ChoiceGraph

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for ChoiceGraph

impl StructuralPartialEq for ChoiceGraph