Struct GraphSpec 

pub struct GraphSpec {
    pub spec_version: String,
    pub name: String,
    pub entry: String,
    pub output_key: Option<String>,
    pub nodes: Vec<NodeSpec>,
    pub edges: Vec<EdgeSpec>,
    pub max_iterations: Option<usize>,
    pub max_parallelism: Option<usize>,
    pub reducers: BTreeMap<String, ReducerKind>,
}

Fields

spec_version: String

name: String

entry: String

output_key: Option<String>

Explicit state key returned as final_state. When absent, legacy graphs continue to expose __input__ as their terminal output.

nodes: Vec<NodeSpec>

edges: Vec<EdgeSpec>

max_iterations: Option<usize>

max_parallelism: Option<usize>

reducers: BTreeMap<String, ReducerKind>

Implementations

impl GraphSpec

pub fn executable_node_type( node_type: &NodeType, ) -> Result<&'static str, String>

Return the executable contract for every declared node type. Reserved effectful classes are deliberately rejected before registration.

pub fn normalize(self) -> Self

pub fn warnings(&self) -> Vec<String>

pub fn resume_eligibility(&self) -> Result<ResumeEligibility, String>

Classify resume support from the declarative graph only. Runtime observations never upgrade an ineligible graph into the supported lane.

Trait Implementations

impl Clone for GraphSpec

fn clone(&self) -> GraphSpec

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GraphSpec

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for GraphSpec

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for GraphSpec

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

where __S: Serializer,

Serialize this value into the given Serde serializer.