Struct AdjacencyTable

pub struct AdjacencyTable<N, V>
where
    N: Node,
    V: Weight,
{ /* private fields */ }

Implementations

impl<N, V> AdjacencyTable<N, V>

where N: Node, V: Weight,

pub fn new() -> Self

pub fn capacity(&self) -> usize

pub fn clear(&mut self)

pub fn contains_key(&self, key: &N) -> bool

pub fn drain(&mut self) -> Drain<'_, N, Vec<(N, V)>>

pub fn entry(&mut self, key: N) -> Entry<'_, N, Vec<(N, V)>>

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

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

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

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

pub fn keys(&self) -> Keys<'_, N, Vec<(N, V)>>

pub fn len(&self) -> usize

pub fn table(self) -> HashMap<N, Vec<(N, V)>>

pub fn values(&self) -> Values<'_, N, Vec<(N, V)>>

pub fn values_mut(&mut self) -> ValuesMut<'_, N, Vec<(N, V)>>

pub fn with_capacity(capacity: usize) -> Self

Trait Implementations

impl<N, V> AsMut<AdjacencyTable<N, V>> for DirectedGraph<N, V>

where N: Node, V: Weight,

fn as_mut(&mut self) -> &mut AdjacencyTable<N, V>

Converts this type into a mutable reference of the (usually inferred) input type.

impl<N, V> AsMut<AdjacencyTable<N, V>> for UndirectedGraph<N, V>

where N: Node, V: Weight,

fn as_mut(&mut self) -> &mut AdjacencyTable<N, V>

Converts this type into a mutable reference of the (usually inferred) input type.

impl<N, V> AsRef<AdjacencyTable<N, V>> for DirectedGraph<N, V>

where N: Node, V: Weight,

fn as_ref(&self) -> &AdjacencyTable<N, V>

Converts this type into a shared reference of the (usually inferred) input type.

impl<N, V> AsRef<AdjacencyTable<N, V>> for UndirectedGraph<N, V>

where N: Node, V: Weight,

fn as_ref(&self) -> &AdjacencyTable<N, V>

Converts this type into a shared reference of the (usually inferred) input type.

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

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

fn clone(&self) -> AdjacencyTable<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 AdjacencyTable<N, V>

where N: Node + Debug, V: Weight + Debug,

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

Formats the value using the given formatter.

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

where N: Node + Default, V: Weight + Default,

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

Returns the “default value” for a type.

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

where N: Node + Deserialize<'de>, V: Weight + 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, V> Extend<(N, Vec<(N, V)>)> for AdjacencyTable<N, V>

where N: Node, V: Weight,

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> From<AdjacencyTable<N, V>> for DirectedGraph<N, V>

where N: Node, V: Weight,

fn from(store: AdjacencyTable<N, V>) -> Self

Converts to this type from the input type.

impl<N, V> From<AdjacencyTable<N, V>> for UndirectedGraph<N, V>

where N: Node, V: Weight,

fn from(store: AdjacencyTable<N, V>) -> Self

Converts to this type from the input type.

impl<N, V> From<HashMap<N, Vec<(N, V)>>> for AdjacencyTable<N, V>

where N: Node, V: Weight,

fn from(store: HashMap<N, Vec<(N, V)>>) -> Self

Converts to this type from the input type.

impl<N, V> FromIterator<(N, Vec<(N, V)>)> for AdjacencyTable<N, V>

where N: Node, V: Weight,

fn from_iter<T: IntoIterator<Item = (N, Vec<(N, V)>)>>(iter: T) -> Self

Creates a value from an iterator.

impl<N, V> Index<N> for AdjacencyTable<N, V>

where N: Node, V: Weight,

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 AdjacencyTable<N, V>

where N: Node, V: Weight,

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

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

impl<N, V> IntoIterator for AdjacencyTable<N, V>

where N: Node, V: Weight,

type Item = (N, Vec<(N, V)>)

The type of the elements being iterated over.

type IntoIter = IntoIter<N, Vec<(N, V)>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

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

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

fn eq(&self, other: &AdjacencyTable<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> Serialize for AdjacencyTable<N, V>

where N: Node + Serialize, V: Weight + 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 AdjacencyTable<N, V>

where N: Node + Eq, V: Weight + Eq,

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

where N: Node, V: Weight,