pub struct FlowGraph {
pub id: String,
pub kind: FlowKind,
pub name: String,
pub trigger: Option<String>,
pub nodes: Vec<FlowNode>,
pub edges: Vec<FlowEdge>,
pub entrypoints: Vec<u32>,
pub exits: Vec<u32>,
pub provenance_summary: BTreeMap<String, usize>,
}Expand description
The canonical causal representation of one flow: a graph, never a flattened linear step list. Alternate execution paths are preserved as branch edges; false sequential causality is impossible by construction.
Fields§
§id: String§kind: FlowKind§name: String§trigger: Option<String>§nodes: Vec<FlowNode>§edges: Vec<FlowEdge>§entrypoints: Vec<u32>Node indices that start the graph.
exits: Vec<u32>Node indices with no outgoing causal edge (returns).
provenance_summary: BTreeMap<String, usize>Trait Implementations§
Source§impl<'de> Deserialize<'de> for FlowGraph
impl<'de> Deserialize<'de> for FlowGraph
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Auto Trait Implementations§
impl Freeze for FlowGraph
impl RefUnwindSafe for FlowGraph
impl Send for FlowGraph
impl Sync for FlowGraph
impl Unpin for FlowGraph
impl UnsafeUnpin for FlowGraph
impl UnwindSafe for FlowGraph
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