Struct AgentGraph 

pub struct AgentGraph {
    pub id: Uuid,
    pub name: String,
    pub description: Option<String>,
    pub nodes: Vec<AgentNode>,
    pub edges: Vec<GraphEdge>,
}

A directed acyclic graph of agents.

Fields

id: Uuid

name: String

description: Option<String>

nodes: Vec<AgentNode>

edges: Vec<GraphEdge>

Implementations

impl AgentGraph

pub fn topological_order(&self) -> Result<Vec<&AgentNode>, String>

Returns nodes in topological order (Kahn’s algorithm). Returns Err if the graph contains a cycle.

Trait Implementations

impl Clone for AgentGraph

fn clone(&self) -> AgentGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for AgentGraph

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for AgentGraph

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for AgentGraph

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

where __S: Serializer,

Serialize this value into the given Serde serializer.