Struct algorithms_edu::algo::graph::tree::with_parent::UnsafeTreeNode

pub struct UnsafeTreeNode {
    pub id: usize,
    pub parent: *const UnsafeTreeNode,
    pub children: Vec<Box<UnsafeTreeNode>>,
}

Fields

id: usize

parent: *const UnsafeTreeNode

children: Vec<Box<UnsafeTreeNode>>

Implementations

impl UnsafeTreeNode

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

impl UnsafeTreeNode

pub fn new(id: usize, parent: *const UnsafeTreeNode) -> Self

Trait Implementations

impl Debug for UnsafeTreeNode

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

Formats the value using the given formatter.

impl Eq for UnsafeTreeNode

impl PartialEq<UnsafeTreeNode> for UnsafeTreeNode

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

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

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

This method tests for !=.

impl StructuralEq for UnsafeTreeNode

impl StructuralPartialEq for UnsafeTreeNode