pub struct BehaviorGraph {
pub states: Vec<StateVals>,
pub edges: Vec<Vec<Edge>>,
pub concrete: Vec<Vec<ConcreteSuccessor>>,
pub roots: Vec<usize>,
}Expand description
A fully explored behavior graph in the engine’s discovery order. States use the bound model’s IR variable order. Fingerprint-mode identity has the same collision qualifications as the safety engine.
Fields§
§states: Vec<StateVals>Concrete state representatives, including all variable assignments.
edges: Vec<Vec<Edge>>Outgoing edges in generator order, then the implicit stutter.
concrete: Vec<Vec<ConcreteSuccessor>>Accepted original generated successors in source-wide generator order.
Rows include duplicates and seen successors, and exclude implicit stutter.
Their concrete values must not be reconstructed from states[edge.to].
roots: Vec<usize>Distinct in-model initial states in discovery order.
Trait Implementations§
Source§impl Clone for BehaviorGraph
impl Clone for BehaviorGraph
Auto Trait Implementations§
impl !RefUnwindSafe for BehaviorGraph
impl !UnwindSafe for BehaviorGraph
impl Forget for BehaviorGraph
impl Freeze for BehaviorGraph
impl Move for BehaviorGraph
impl Send for BehaviorGraph
impl Sync for BehaviorGraph
impl Unpin for BehaviorGraph
impl UnsafeUnpin for BehaviorGraph
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more