[−][src]Trait net_ensembles::traits::GraphIteratorsMut
Collection mut Graph iterators
Required methods
fn contained_iter_neighbors_mut(
&mut self,
index: usize
) -> NContainedIterMut<T, A>
&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>
&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 exampleEmptyNode
or whatever you used)
Implementors
impl<T, R> GraphIteratorsMut<T, GenericGraph<T, NodeContainer<T>>, NodeContainer<T>> for ErEnsembleC<T, R> where
T: Node + SerdeStateConform,
R: Rng,
[src]
T: Node + SerdeStateConform,
R: Rng,
fn contained_iter_neighbors_mut(
&mut self,
index: usize
) -> NContainedIterMut<T, NodeContainer<T>>
[src]
&mut self,
index: usize
) -> NContainedIterMut<T, NodeContainer<T>>
fn contained_iter_neighbors_mut_with_index(
&mut self,
index: usize
) -> INContainedIterMut<T, NodeContainer<T>>
[src]
&mut self,
index: usize
) -> INContainedIterMut<T, NodeContainer<T>>
fn contained_iter_mut(&mut self) -> ContainedIterMut<T, NodeContainer<T>>
[src]
impl<T, R> GraphIteratorsMut<T, GenericGraph<T, NodeContainer<T>>, NodeContainer<T>> for ErEnsembleM<T, R> where
T: Node + SerdeStateConform,
R: Rng,
[src]
T: Node + SerdeStateConform,
R: Rng,
fn contained_iter_neighbors_mut(
&mut self,
index: usize
) -> NContainedIterMut<T, NodeContainer<T>>
[src]
&mut self,
index: usize
) -> NContainedIterMut<T, NodeContainer<T>>
fn contained_iter_neighbors_mut_with_index(
&mut self,
index: usize
) -> INContainedIterMut<T, NodeContainer<T>>
[src]
&mut self,
index: usize
) -> INContainedIterMut<T, NodeContainer<T>>
fn contained_iter_mut(&mut self) -> ContainedIterMut<T, NodeContainer<T>>
[src]
impl<T, R> GraphIteratorsMut<T, GenericGraph<T, SwContainer<T>>, SwContainer<T>> for SwEnsemble<T, R> where
T: Node + SerdeStateConform,
R: Rng,
[src]
T: Node + SerdeStateConform,
R: Rng,
fn contained_iter_neighbors_mut(
&mut self,
index: usize
) -> NContainedIterMut<T, SwContainer<T>>
[src]
&mut self,
index: usize
) -> NContainedIterMut<T, SwContainer<T>>
fn contained_iter_neighbors_mut_with_index(
&mut self,
index: usize
) -> INContainedIterMut<T, SwContainer<T>>
[src]
&mut self,
index: usize
) -> INContainedIterMut<T, SwContainer<T>>