[−][src]Trait net_ensembles::traits::GraphIteratorsMut

pub trait GraphIteratorsMut<T, G, A> where
    T: Node,
    A: AdjContainer<T>, {
    fn contained_iter_neighbors_mut(
        &mut self, 
        index: usize
    ) -> NContainedIterMut<T, A>;

    fn contained_iter_neighbors_mut_with_index(
        &mut self, 
        index: usize
    ) -> INContainedIterMut<T, A>;

    fn contained_iter_mut(&mut self) -> ContainedIterMut<T, A>;
}

Collection mut Graph iterators

Required methods

fn contained_iter_neighbors_mut(
    &mut self,
    index: usize
) -> NContainedIterMut<T, A>

  • 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

fn contained_iter_neighbors_mut_with_index(
    &mut self,
    index: usize
) -> INContainedIterMut<T, A>

  • 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

fn contained_iter_mut(&mut self) -> ContainedIterMut<T, A>

  • 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)
Loading content...

Implementors

impl<T, R> GraphIteratorsMut<T, GenericGraph<T, NodeContainer<T>>, NodeContainer<T>> for ErEnsembleC<T, R> where
    T: Node + SerdeStateConform,
    R: Rng, [src]

impl<T, R> GraphIteratorsMut<T, GenericGraph<T, NodeContainer<T>>, NodeContainer<T>> for ErEnsembleM<T, R> where
    T: Node + SerdeStateConform,
    R: Rng, [src]

impl<T, R> GraphIteratorsMut<T, GenericGraph<T, SwContainer<T>>, SwContainer<T>> for SwEnsemble<T, R> where
    T: Node + SerdeStateConform,
    R: Rng, [src]

Loading content...