[−][src]Struct algorithms_edu::algo::graph::tree::rooting::TreeNode

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

Fields

id: usizechildren: Vec<TreeNode>

Implementations

`impl TreeNode`[src]

`pub fn encode(&self) -> Vec<u8>`[src]

`impl TreeNode`[src]

`pub fn new(id: usize) -> Self`[src]

`pub fn from_adjacency_list(graph: &UnweightedAdjacencyList, root: usize) -> Self`[src]

Trait Implementations

`impl Debug for TreeNode`[src]

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

`impl Eq for TreeNode`[src]

`impl PartialEq<TreeNode> for TreeNode`[src]

`pub fn eq(&self, other: &TreeNode) -> bool`[src]

`pub fn ne(&self, other: &TreeNode) -> bool`[src]

`impl StructuralEq for TreeNode`[src]

`impl StructuralPartialEq for TreeNode`[src]

Auto Trait Implementations

`impl RefUnwindSafe for TreeNode`[src]

`impl Send for TreeNode`[src]

`impl Sync for TreeNode`[src]

`impl Unpin for TreeNode`[src]

`impl UnwindSafe for TreeNode`[src]

Blanket Implementations

`impl<T> Any for T where T: 'static + ?Sized,` [src]

`pub fn type_id(&self) -> TypeId`[src]

`impl<T> Borrow<T> for T where T: ?Sized,` [src]

`pub fn borrow(&self) -> &T`[src]

`impl<T> BorrowMut<T> for T where T: ?Sized,` [src]

`pub fn borrow_mut(&mut self) -> &mut T`[src]

`impl<Q, K> Equivalent<K> for Q where K: Borrow<Q> + ?Sized, Q: Eq + ?Sized,` [src]

`pub fn equivalent(&self, key: &K) -> bool`[src]

`impl<T> From<T> for T`[src]

`pub fn from(t: T) -> T`[src]

`impl<T, U> Into for T where U: From<T>,` [src]

`pub fn into(self) -> U`[src]

`impl<T, U> TryFrom for T where U: Into<T>,` [src]

`type Error = Infallible`

The type returned in the event of a conversion error.

`pub fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>`[src]

`impl<T, U> TryInto for T where U: TryFrom<T>,` [src]

`type Error = >::Error`

The type returned in the event of a conversion error.

`pub fn try_into(self) -> Result<U, >::Error>`[src]

`impl<V, T> VZip<V> for T where V: MultiLane<T>,`

`pub fn vzip(self) -> V`

[−][src]Struct algorithms_edu::algo::graph::tree::rooting::TreeNode

Fields

Implementations

impl TreeNode[src]

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

impl TreeNode[src]

pub fn new(id: usize) -> Self[src]

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

Trait Implementations

impl Debug for TreeNode[src]

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

impl Eq for TreeNode[src]

impl PartialEq<TreeNode> for TreeNode[src]

pub fn eq(&self, other: &TreeNode) -> bool[src]

pub fn ne(&self, other: &TreeNode) -> bool[src]

impl StructuralEq for TreeNode[src]

impl StructuralPartialEq for TreeNode[src]

Auto Trait Implementations

impl RefUnwindSafe for TreeNode[src]

impl Send for TreeNode[src]

impl Sync for TreeNode[src]

impl Unpin for TreeNode[src]

impl UnwindSafe for TreeNode[src]

Blanket Implementations

impl<T> Any for T where T: 'static + ?Sized, [src]

pub fn type_id(&self) -> TypeId[src]

impl<T> Borrow<T> for T where T: ?Sized, [src]

pub fn borrow(&self) -> &T[src]

impl<T> BorrowMut<T> for T where T: ?Sized, [src]

pub fn borrow_mut(&mut self) -> &mut T[src]

impl<Q, K> Equivalent<K> for Q where K: Borrow<Q> + ?Sized, Q: Eq + ?Sized, [src]

pub fn equivalent(&self, key: &K) -> bool[src]

impl<T> From<T> for T[src]

pub fn from(t: T) -> T[src]

impl<T, U> Into<U> for T where U: From<T>, [src]

pub fn into(self) -> U[src]

impl<T, U> TryFrom<U> for T where U: Into<T>, [src]

type Error = Infallible

pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>[src]

impl<T, U> TryInto<U> for T where U: TryFrom<T>, [src]

type Error = <U as TryFrom<T>>::Error

pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>[src]

impl<V, T> VZip<V> for T where V: MultiLane<T>,

pub fn vzip(self) -> V

`impl TreeNode`[src]

`pub fn encode(&self) -> Vec<u8>`[src]

`impl TreeNode`[src]

`pub fn new(id: usize) -> Self`[src]

`pub fn from_adjacency_list(graph: &UnweightedAdjacencyList, root: usize) -> Self`[src]

`impl Debug for TreeNode`[src]

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

`impl Eq for TreeNode`[src]

`impl PartialEq<TreeNode> for TreeNode`[src]

`pub fn eq(&self, other: &TreeNode) -> bool`[src]

`pub fn ne(&self, other: &TreeNode) -> bool`[src]

`impl StructuralEq for TreeNode`[src]

`impl StructuralPartialEq for TreeNode`[src]

`impl RefUnwindSafe for TreeNode`[src]

`impl Send for TreeNode`[src]

`impl Sync for TreeNode`[src]

`impl Unpin for TreeNode`[src]

`impl UnwindSafe for TreeNode`[src]

`impl<T> Any for T where T: 'static + ?Sized,` [src]

`pub fn type_id(&self) -> TypeId`[src]

`impl<T> Borrow<T> for T where T: ?Sized,` [src]

`pub fn borrow(&self) -> &T`[src]

`impl<T> BorrowMut<T> for T where T: ?Sized,` [src]

`pub fn borrow_mut(&mut self) -> &mut T`[src]

`impl<Q, K> Equivalent<K> for Q where K: Borrow<Q> + ?Sized, Q: Eq + ?Sized,` [src]

`pub fn equivalent(&self, key: &K) -> bool`[src]

`impl<T> From<T> for T`[src]

`pub fn from(t: T) -> T`[src]

`impl<T, U> Into<U> for T where U: From<T>,` [src]

`pub fn into(self) -> U`[src]

`impl<T, U> TryFrom<U> for T where U: Into<T>,` [src]

`type Error = Infallible`

`pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>`[src]

`impl<T, U> TryInto<U> for T where U: TryFrom<T>,` [src]

`type Error = <U as TryFrom<T>>::Error`

`pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>`[src]

`impl<V, T> VZip<V> for T where V: MultiLane<T>,`

`pub fn vzip(self) -> V`