Struct graaf::adjacency_list::digraph::Digraph

pub struct Digraph { /* private fields */ }

An adjacency list representation of an unweighted digraph

Trait Implementations

impl AddArc for Digraph

fn add_arc(&mut self, u: usize, v: usize)

Adds an arc from u to v to the digraph.

impl ArcWeight<usize> for Digraph

fn arc_weight(&self, u: usize, v: usize) -> Option<&usize>

Returns the weight of the arc from u to v if it exists in the digraph.

impl Arcs for Digraph

fn arcs(&self) -> impl Iterator<Item = (usize, usize)>

Returns an iterator over the arcs in the digraph.

impl ArcsWeighted<usize> for Digraph

fn arcs_weighted<'a>( &'a self, ) -> impl Iterator<Item = (usize, usize, &'a usize)>

where usize: 'a,

Returns an iterator over the weighted arcs in the digraph.

impl Clone for Digraph

fn clone(&self) -> Digraph

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Converse for Digraph

fn converse(&self) -> Self

Generates the converse of the digraph

impl Debug for Digraph

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

Formats the value using the given formatter.

impl Empty for Digraph

fn empty(order: usize) -> Self

Generates an empty digraph.

fn trivial() -> Self

where Self: Sized,

Generates a trivial digraph.

impl From<Vec<BTreeSet<usize>>> for Digraph

fn from(arcs: Vec<BTreeSet<usize>>) -> Self

Converts to this type from the input type.

impl HasArc for Digraph

fn has_arc(&self, u: usize, v: usize) -> bool

Returns whether an arc exists from u to v in the digraph.

impl Hash for Digraph

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Indegree for Digraph

fn indegree(&self, v: usize) -> usize

Returns the indegree of a vertex in the digraph.

fn is_source(&self, v: usize) -> bool

Returns whether a vertex is a source of the digraph.

impl IsSimple for Digraph

fn is_simple(&self) -> bool

Returns whether the digraph is simple.

impl Ord for Digraph

fn cmp(&self, other: &Digraph) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized + PartialOrd,

Restrict a value to a certain interval.

impl Order for Digraph

fn order(&self) -> usize

Count the vertices in the digraph.

impl OutNeighbors for Digraph

fn out_neighbors(&self, u: usize) -> impl Iterator<Item = usize>

Panics

Panics if u is out of bounds.

impl OutNeighborsWeighted<usize> for Digraph

fn out_neighbors_weighted<'a>( &'a self, u: usize, ) -> impl Iterator<Item = (usize, &'a usize)>

where usize: 'a,

Panics

Panics if u is out of bounds.

impl Outdegree for Digraph

fn outdegree(&self, u: usize) -> usize

Panics

Panics if u is out of bounds.

fn is_sink(&self, u: usize) -> bool

Returns whether a vertex is a sink of the digraph.

impl PartialEq for Digraph

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

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

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialOrd for Digraph

fn partial_cmp(&self, other: &Digraph) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl RemoveArc for Digraph

fn remove_arc(&mut self, u: usize, v: usize) -> bool

Removes the arc from u to v from the digraph. Returns whether the arc was removed.

impl Size for Digraph

fn size(&self) -> usize

Counts the arcs in the digraph.

impl Vertices for Digraph

fn vertices(&self) -> impl Iterator<Item = usize>

Returns an iterator over the vertices.

impl Eq for Digraph

impl StructuralPartialEq for Digraph