Struct Edges

pub struct Edges<D: Domain> { /* private fields */ }

The outgoing edges from a node, possibly partially expanded.

Implementations

impl<D: Domain> Edges<D>

pub fn new( node: &Node<D>, initial_state: &D::State, next_task: Option<Box<dyn Task<D>>>, ) -> Self

Creates new edges, with optionally a forced task that will be the sole edge.

pub fn child_visits(&self) -> usize

Returns the sum of all visits to the edges of this nodes.

pub fn best_task( &self, agent: AgentId, exploration: f32, range: Range<AgentValue>, ) -> Option<Box<dyn Task<D>>>

Finds the best task with the given exploration factor and normalization range.

pub fn q_value(&self, fallback: (usize, f32), agent: AgentId) -> Option<f32>

Returns the weighted average q value of all child edges.

The fallback value is used for self-referential edges.

pub fn expanded_count(&self) -> usize

Returns the number of already-expanded edges.

pub fn unexpanded_count(&self) -> usize

Returns the number of not-yet-expanded edges.

pub fn branching_factor(&self) -> usize

Returns how many edges there are, the sum of the expanded and not-yet expanded counts.

pub fn get_edge(&self, task: &Box<dyn Task<D>>) -> Option<Edge<D>>

Returns the expanded edge associated to a task, None if it does not exist.

pub fn size(&self, task_size: fn(&dyn Task<D>) -> usize) -> usize

The memory footprint of this struct.

Trait Implementations

impl<D: Domain> Debug for Edges<D>

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

Formats the value using the given formatter.

impl<'a, D: Domain> IntoIterator for &'a Edges<D>

type Item = (&'a Box<dyn Task<D>>, &'a Arc<Mutex<EdgeInner<D>>>)

The type of the elements being iterated over.

type IntoIter = Iter<'a, Box<dyn Task<D>>, Arc<Mutex<EdgeInner<D>>>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.