Struct Graph 

pub struct Graph {
    pub root: Option<Uuid>,
    pub nodes: HashMap<Uuid, Node>,
    pub links: Vec<Link>,
    pub variables: HashMap<Uuid, String>,
}

The shared behavior graph: nodes, the links between their slots, the named blackboard variables, and (for tree-shaped interpreters) the root node.

Fields

root: Option<Uuid>

The entry node, for interpreters that need one (a behavior tree’s root).

nodes: HashMap<Uuid, Node>

All nodes, indexed by id.

links: Vec<Link>

The links wiring node slots together.

variables: HashMap<Uuid, String>

Named blackboard variables (id -> name); a LinkSource::Variable refers to one of these, and the name is what an interpreter resolves against the data store.

Implementations

impl Graph

pub fn empty() -> Self

An empty graph — the starting point a load diff is applied onto.

pub fn node(&self, id: &Uuid) -> Option<&Node>

The node with id id, if present.

pub fn link_to(&self, target: &Port) -> Option<&Link>

The link feeding target, if any.

pub fn apply(&mut self, diff: GraphDiff) -> Result<(), GraphError>

Apply diff in place.

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

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<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for Graph

fn eq(&self, other: &Graph) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl Serialize for Graph

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for Graph