Struct GraphNode

pub struct GraphNode<E> {
    pub edges: Vec<E>,
}

グラフのノード

Fields

edges: Vec<E>

接続する辺

Implementations

impl<E: EdgeTrait> GraphNode<E>

pub fn neighbors(&self) -> impl DoubleEndedIterator<Item = &E>

隣接辺を列挙するイテレータを返す。

pub fn neighbors_size(&self) -> usize

隣接辺の個数を返す。

Trait Implementations

impl<E: Clone> Clone for GraphNode<E>

fn clone(&self) -> GraphNode<E>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<E: Debug> Debug for GraphNode<E>

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

Formats the value using the given formatter.

impl<'a, E: EdgeTrait> IntoIterator for &'a GraphNode<E>

type Item = &'a E

The type of the elements being iterated over.

type IntoIter = Iter<'a, E>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<E: EdgeTrait> IntoIterator for GraphNode<E>

type Item = E

The type of the elements being iterated over.

type IntoIter = IntoIter<<GraphNode<E> as IntoIterator>::Item>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.