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

pub struct Node {
    pub id: usize,
    pub children: Vec<Node>,
}

Representation of a tree node, which has an id and a Vec of children. children is empty if the node does not have children.

Fields

id: usize

children: Vec<Node>

Implementations

impl Node

pub fn height(&self) -> usize

impl Node

pub fn encode(&self) -> Vec<u8>

impl Node

pub fn from_adjacency_list(graph: &UnweightedAdjacencyList, root: usize) -> Self

impl Node

pub fn new(id: usize) -> Self

Creates a new node without 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

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

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

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

This method tests for !=.

impl StructuralEq for Node

impl StructuralPartialEq for Node