Struct algorithms_edu::algo::graph::tree::with_parent::Node

pub struct Node {
    pub id: usize,
    pub parent: Option<Weak<RefCell<Node>>>,
    pub children: Vec<Rc<RefCell<Node>>>,
}

Representation of a tree node, which has an id, a Vec of children, as well as a Weak reference to its parent

Fields

id: usize

parent: Option<Weak<RefCell<Node>>>

children: Vec<Rc<RefCell<Node>>>

Implementations

impl Node

pub fn from_adjacency_list(
    graph: &UnweightedAdjacencyList,
    root: usize
) -> Rc<RefCell<Node>>

impl Node

pub fn new(id: usize, parent: Option<&Rc<RefCell<Node>>>) -> Rc<RefCell<Node>>

Creates a new node either with or without a parent.

pub fn add_child(parent: &Rc<RefCell<Node>>, child: &Rc<RefCell<Node>>)

Add a child node to a parent node. First, a Weak reference to the parent is created and stored in the child. Then, a clone is pushed onto the parent's Vec of children

Trait Implementations

impl Debug for Node

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

Formats the value using the given formatter.

impl Eq for Node

impl PartialEq<Node> for Node

Two nodes are identical if their ids equal, have the same children, and have the same parent id. #[derive(PartialEq, Eq)] does not work with Weak references, so we need manual implementation.

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

This method tests for self and other values to be equal, and is used by ==.

#[must_use]pub fn ne(&self, other: &Rhs) -> bool

This method tests for !=.