Struct AdjacencyMatrix

pub struct AdjacencyMatrix<N = String, V = i64>
where
    N: Node,
    V: Clone + PartialEq,
{ /* private fields */ }

Implementations

impl<N: Node, V: Clone + PartialEq> AdjacencyMatrix<N, V>

pub fn new() -> Self

pub fn clear(&mut self)

Clears the matrix, removing all elements.

pub fn capacity(&self) -> usize

Returns the number of elements the matrix can hold without reallocating.

pub fn get(&self, key: &N) -> Option<&Vec<(N, V)>>

Returns a reference to the value corresponding to the key.

pub fn get_key_value(&self, key: &N) -> Option<(&N, &Vec<(N, V)>)>

Returns a reference to the key and its value(s).

pub fn get_mut(&mut self, key: &N) -> Option<&mut Vec<(N, V)>>

Returns a mutable reference to the value corresponding to the key.

pub fn keys(&self) -> impl Iterator<Item = &N>

Returns an iterator over the elements of the matrix.

pub fn len(&self) -> usize

Returns the number of elements in the matrix.

pub fn push(&mut self, elem: N, value: Vec<(N, V)>)

Pushes a new element to the matrix.

pub fn shrink_to_fit(&mut self)

Shrinks the capacity of the matrix as much as possible.

pub fn with_capacity(capacity: usize) -> Self

Reserves capacity for at least additional more elements to be inserted in the matrix.

Trait Implementations

impl<N, V> Clone for AdjacencyMatrix<N, V>

where N: Node + Clone, V: Clone + PartialEq + Clone,

fn clone(&self) -> AdjacencyMatrix<N, V>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<N, V> Debug for AdjacencyMatrix<N, V>

where N: Node + Debug, V: Clone + PartialEq + Debug,

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

Formats the value using the given formatter.

impl<N, V> Default for AdjacencyMatrix<N, V>

where N: Node + Default, V: Clone + PartialEq + Default,

fn default() -> AdjacencyMatrix<N, V>

Returns the “default value” for a type.

impl<'de, N, V> Deserialize<'de> for AdjacencyMatrix<N, V>

where N: Node + Deserialize<'de>, V: Clone + PartialEq + Deserialize<'de>,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<N: Node, V: Clone + PartialEq> Extend<(N, Vec<(N, V)>)> for AdjacencyMatrix<N, V>

fn extend<T: IntoIterator<Item = (N, Vec<(N, V)>)>>(&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<N, V> Hash for AdjacencyMatrix<N, V>

where N: Node + Hash, V: Clone + PartialEq + Hash,

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<N, V> Index<N> for AdjacencyMatrix<N, V>

where N: Node, V: Clone + PartialEq,

type Output = Vec<(N, V)>

The returned type after indexing.

fn index(&self, index: N) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<N, V> IndexMut<N> for AdjacencyMatrix<N, V>

where N: Node, V: Clone + PartialEq,

fn index_mut(&mut self, index: N) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.

impl<N, V> Ord for AdjacencyMatrix<N, V>

where N: Node + Ord, V: Clone + PartialEq + Ord,

fn cmp(&self, other: &AdjacencyMatrix<N, V>) -> 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,

Restrict a value to a certain interval.

impl<N, V> PartialEq for AdjacencyMatrix<N, V>

where N: Node + PartialEq, V: Clone + PartialEq + PartialEq,

fn eq(&self, other: &AdjacencyMatrix<N, V>) -> bool

Tests for self and other values to be equal, and is used by ==.

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

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

impl<N, V> PartialOrd for AdjacencyMatrix<N, V>

where N: Node + PartialOrd, V: Clone + PartialEq + PartialOrd,

fn partial_cmp(&self, other: &AdjacencyMatrix<N, V>) -> Option<Ordering>

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

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

Tests less than (for self and other) and is used by the < operator.

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

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

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

Tests greater than (for self and other) and is used by the > operator.

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

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

impl<N, V> Serialize for AdjacencyMatrix<N, V>

where N: Node + Serialize, V: Clone + PartialEq + Serialize,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<N, V> Eq for AdjacencyMatrix<N, V>

where N: Node + Eq, V: Clone + PartialEq + Eq,

impl<N, V> StructuralPartialEq for AdjacencyMatrix<N, V>

where N: Node, V: Clone + PartialEq,