Trait net_ensembles::traits::GraphIteratorsMut

source · [−]
pub trait GraphIteratorsMut<T, G, A>where
    T: Node,
    A: AdjContainer<T>,{
    fn contained_iter_neighbors_mut(
        &mut self,
        index: usize
    ) -> NContainedIterMut<'_, T, A, IterWrapper<'_>>ⓘNotable traits for NContainedIterMut<'a, T, A, I>impl<'a, T, A, I> Iterator for NContainedIterMut<'a, T, A, I>where
    T: 'a,
    A: AdjContainer<T>,
    I: Iterator<Item = &'a usize> + 'a,    type Item = &'a mut T;;
    fn contained_iter_neighbors_mut_with_index(
        &mut self,
        index: usize
    ) -> INContainedIterMut<'_, T, A>ⓘNotable traits for INContainedIterMut<'a, T, A>impl<'a, T, A> Iterator for INContainedIterMut<'a, T, A>where
    T: 'a + Node,
    A: AdjContainer<T>,    type Item = (usize, &'a mut T);;
    fn contained_iter_mut(&mut self) -> ContainedIterMut<'_, T, A>ⓘNotable traits for ContainedIterMut<'a, T, A>impl<'a, T, A> Iterator for ContainedIterMut<'a, T, A>where
    T: 'a + Node,
    A: AdjContainer<T>,    type Item = &'a mut T;;
}
Expand description

Collection mut Graph iterators

Required Methods

  • iterate over mutable additional information of neighbors of vertex index
  • iterator returns &mut T
  • sort_adj will affect the order
  • panics if index out of bounds
  • iterate over mutable additional information of neighbors of vertex index
  • iterator returns (index_neighbor: usize, neighbor: &mut T)
  • sort_adj will affect the order
  • panics if index out of bounds
  • get iterator over mutable additional information stored at each vertex in order of the indices
  • iterator returns a Node (for example EmptyNode or whatever you used)

Implementors