Skip to main content

GraphBuilder

Struct GraphBuilder 

Source
pub struct GraphBuilder { /* private fields */ }
Expand description

Builder for a Graph. Register nodes and edges, set the entry point, then GraphBuilder::compile to validate and freeze.

Implementations§

Source§

impl GraphBuilder

Source

pub fn new() -> Self

An empty builder.

Source

pub fn add_node<N>(&mut self, name: impl Into<String>, node: N) -> &mut Self
where N: Node + 'static,

Register a node under name.

Accepts any Node impl — including async closures (Fn(NodeContext) -> impl Future<Output = Result<NodeOutput>>) via the blanket impl. Re-registering the same name replaces the node.

Source

pub fn add_edge( &mut self, from: impl Into<String>, to: impl Into<String>, ) -> &mut Self

Add a static edge from → to. Multiple outgoing static edges from the same node activate all destinations in parallel in the next super-step.

GraphBuilder::compile rejects a node that has both static and conditional edges — ambiguous routing fails when you call compile(), not as a runtime surprise. Dynamic routing via Command::goto from a node that also has static edges remains a runtime rule: both paths execute.

Source

pub fn add_conditional_edges<F, Fut>( &mut self, from: impl Into<String>, router: F, ) -> &mut Self
where F: Fn(State) -> Fut + Send + Sync + 'static, Fut: Future<Output = Result<Route>> + Send + 'static,

Add a conditional edge: after from completes, run router against the post-barrier state and follow the returned Route.

use rusty_agent_runtime::graph::{GraphBuilder, Route};

let mut builder = GraphBuilder::new();
builder.add_conditional_edges("agent", |state| async move {
    let needs_tools = state.get("messages")
        .and_then(|m| m.as_array())
        .and_then(|a| a.last())
        .map(|m| m.get("tool_calls").is_some())
        .unwrap_or(false);
    Ok(if needs_tools { Route::Node("tools".into()) } else { Route::End })
});
Source

pub fn set_entry_point(&mut self, name: impl Into<String>) -> &mut Self

Set the entry-point node (the LangGraph START edge).

Source

pub fn compile(self) -> Result<Graph>

Validate and freeze the graph.

Validation (all failures are RustyError::Graph):

  • at least one node is registered;
  • the entry point is set and references a known node;
  • every edge endpoint (from, and to for static edges) references a known node;
  • no node is registered under a reserved name (END or any __-prefixed name);
  • no duplicate static from → to edge (a duplicate would activate the target twice in one super-step, which surfaces as a spurious double-write failure on single-write channels);
  • at most one conditional edge per source node;
  • no source node mixes static and conditional edges.

Conditional router targets and Send node names are validated at execution time (they are data-dependent by design).

Trait Implementations§

Source§

impl Default for GraphBuilder

Source§

fn default() -> GraphBuilder

Returns the “default value” for a type. Read more

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T> Instrument for T

Source§

fn instrument(self, span: Span) -> Instrumented<Self> ⓘ

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
Source§

fn in_current_span(self) -> Instrumented<Self> ⓘ

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> PolicyExt for T
where T: ?Sized,

Source§

fn and<P, B, E>(self, other: P) -> And<T, P>
where T: Sized + Policy<B, E>, P: Policy<B, E>,

Create a new Policy that returns Action::Follow only if self and other return Action::Follow. Read more
Source§

fn or<P, B, E>(self, other: P) -> Or<T, P>
where T: Sized + Policy<B, E>, P: Policy<B, E>,

Create a new Policy that returns Action::Follow if either self or other returns Action::Follow. Read more
Source§

impl<T> Read<Exclusive, BecauseExclusive> for T
where T: ?Sized,

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V

Source§

impl<T> WithSubscriber for T

Source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self> ⓘ
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
Source§

fn with_current_subscriber(self) -> WithDispatch<Self> ⓘ

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more