Type Definition net_ensembles::dual_graph::SingleDualGraph

source · [−]

pub type SingleDualGraph<T1, A1, T2, A2> = DualGraph<AdjSingle, T1, A1, T2, A2>;

Implementations

impl<T, A1, A2> SingleDualGraph<T, A1, T, A2>where
A1: AdjContainer<T> + AdjList<usize>,
A2: AdjContainer<T> + AdjList<usize>,

pub fn graph_1_contained_iter_neighbors_in_other_graph_mut(
&mut self,
index: usize
) -> impl Iterator<Item = &mut T>

pub fn graph_2_contained_iter_neighbors_in_other_graph_mut(
&mut self,
index: usize
) -> impl Iterator<Item = &mut T>

pub fn graph_1_contained_iter_mut(
&mut self,
index: usize
) -> impl Iterator<Item = &mut T>

Note: This will first iterate over all neighbors from this graph and then over all neighbors from the other graph

pub fn graph_1_contained_iter(&self, index: usize) -> impl Iterator<Item = &T>

Note: This will first iterate over all neighbors from this graph and then over all neighbors from the other graph

pub fn graph_2_contained_iter(&self, index: usize) -> impl Iterator<Item = &T>

Note: This will first iterate over all neighbors from this graph and then over all neighbors from the other graph

pub fn graph_1_contained_iter_mut_which_graph_with_index(
&mut self,
index: usize
) -> impl Iterator<Item = WhichGraph<(usize, &mut T)>>

pub fn graph_1_contained_iter_mut_which_graph(
&mut self,
index: usize
) -> impl Iterator<Item = WhichGraph<&mut T>>

pub fn graph_2_contained_iter_mut_which_graph(
&mut self,
index: usize
) -> impl Iterator<Item = WhichGraph<&mut T>>

pub fn graph_2_contained_iter_mut_which_graph_with_index(
&mut self,
index: usize
) -> impl Iterator<Item = WhichGraph<(usize, &mut T)>>