Struct Node 

pub struct Node<State, Action, Cost> { /* private fields */ }

Implementations

impl<State, Action, Cost> Node<State, Action, Cost>

pub fn cost(&self) -> &Cost

pub fn remaining_cost_estimate(&self) -> &Cost

pub fn state(&self) -> &State

Trait Implementations

impl<State: Clone, Action: Clone, Cost: Clone> Clone for Node<State, Action, Cost>

fn clone(&self) -> Node<State, Action, Cost>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<State: Debug, Action: Debug, Cost: Debug> Debug for Node<State, Action, Cost>

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

Formats the value using the given formatter.

impl<State, Action, Cost> TreeNode for Node<State, Action, Cost>

where Cost: Clone + Add<Cost, Output = Cost>,

type State = State

The type used to describe the state of the node.

type Action = Action

The type of action that can be taken from one node to another.

type Cost = Cost

The type used to decide whether to prefer one node over another. Lower values are preferable.

fn state(&self) -> &Self::State

Get the state of the node.

fn parent(&self) -> Option<(usize, &Self::Action)>

If the node has a parent, get the identity of that parent and the action used to arrive from it.

fn cost(&self) -> Self::Cost

Get the actual cost of arriving at this node from its initial state.

fn queue_evaluation(&self) -> Self::Cost

Evaluate this node for its placement in the search queue. For an uninformed node this would simply return its aggregated cost. For an informed node this would return its aggregated cost plus its remaining cost estimate.

fn queue_bias(&self) -> Option<Self::Cost>

Give a bias to this node. When queue_evaluation is exactly equal, the node will be ordered by this bias instead. Higher bias will push it later in the queue. For an informed node this could be its remaining cost estimate.