Struct Graph 

pub struct Graph {
    pub nodes: BTreeMap<String, GraphNode>,
    pub edges: BTreeSet<Edge>,
}

Fields

nodes: BTreeMap<String, GraphNode>

edges: BTreeSet<Edge>

Implementations

impl Graph

pub fn insert(&mut self, node: GraphNode)

pub fn connect(&mut self, edge: Edge) -> Result<(), ConnectError>

Connect typed ports. Processing graphs are DAGs: rejecting a cycle at the edit boundary means evaluators never need a recursion escape hatch.

Errors

Returns the precise structural reason when either endpoint/port is unknown, the port types differ, the input is occupied, or the edge would introduce a cycle.

pub fn disconnect_input(&mut self, node: &str, port: &str) -> Option<Edge>

pub fn reconnect_input( &mut self, edge: Edge, ) -> Result<Option<Edge>, ConnectError>

Replace one input connection atomically. If the proposed edge is invalid (including a cycle or type mismatch), the previous edge is restored so an imprecise pointer drop can never damage the graph.

Errors

Returns the same structural error as Self::connect when the new edge has an invalid endpoint, incompatible type, occupied input, or would introduce a cycle.

pub fn contributing_nodes(&self, target: &str) -> BTreeSet<String>

The target and every node that contributes to it. Editors use this to distinguish intentional side branches from the live production path.

pub fn remove(&mut self, id: &str) -> Option<GraphNode>

pub fn evaluation_order(&self) -> Result<Vec<String>, ConnectError>

Return a stable topological order for evaluation.

Errors

Returns ConnectError::Cycle if the graph was deserialized from an invalid source that bypassed Graph::connect.

Trait Implementations

impl Clone for Graph

fn clone(&self) -> Graph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Graph

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

Formats the value using the given formatter.

impl Default for Graph

fn default() -> Graph

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for Graph

fn deserialize<__D>( __deserializer: __D, ) -> Result<Graph, <__D as Deserializer<'de>>::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for Graph

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

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for Graph