Struct Graph

pub struct Graph<D, E> { /* private fields */ }

グラフ

Implementations

impl<D: Direction, E: EdgeTrait + Clone> Graph<D, E>

pub fn new(size: usize) -> Self

頂点数がsizeの空のGraphを構築する。

impl<E: EdgeTrait + Clone> Graph<Directed, E>

pub fn add(&mut self, e: E)

有向グラフに辺を追加する。

impl<E: EdgeTrait + Clone> Graph<Undirected, E>

pub fn add(&mut self, e: E)

無向グラフに辺を追加する。

impl<D, E> Graph<D, E>

pub fn nodes_iter(&self) -> impl Iterator<Item = &GraphNode<E>>

各頂点のGraphNodeへの参照のイテレータを返す。

pub fn node_of(&self, i: usize) -> &GraphNode<E>

i番目の頂点のGraphNodeへの参照を返す。

pub fn len(&self) -> usize

グラフの頂点数を返す。

pub fn is_empty(&self) -> bool

グラフの頂点数が0ならばtrueを返す。

Trait Implementations

impl<D: Clone, E: Clone> Clone for Graph<D, E>

fn clone(&self) -> Graph<D, E>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<D: Debug, E: Debug> Debug for Graph<D, E>

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

Formats the value using the given formatter.

impl<E: EdgeTrait + Clone> Extend<E> for Graph<Directed, E>

fn extend<T: IntoIterator<Item = E>>(&mut self, iter: T)

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<E: EdgeTrait + Clone> Extend<E> for Graph<Undirected, E>

fn extend<T: IntoIterator<Item = E>>(&mut self, iter: T)

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.