/// Find the neighbours of the current vertex in the mapping sequence;
///     Ignore the neighbours if they have been in the mapping
Find the neighbours of the current vertex in the mapping sequence;
Ignore the neighbours if they have been in the mapping
Find the neighbours of the current vertex in the mapping sequence ; Ignore the neighbours if they have been in the mapping
pub fn find_new_neighbours<T: core::graph::Vertex>(
    vertex_index: usize,
    mapping_index: &Vec<usize>,
    vv: &core::graph::VertexVec<T>
) -> Vec<usize> {
    vv[vertex_index].neighbour_indexes().into_iter()
        .filter(|nb_idx| !mapping_index.contains(&nb_idx))
        .collect()
}
pub fn find_new_neighbours < T : core :: graph :: Vertex > ( vertex_index : usize , mapping_index : & Vec < usize > , vv : & core :: graph :: VertexVec < T > ) -> Vec < usize > { vv [ vertex_index ] . neighbour_indexes ( ) . into_iter ( ) . filter ( | nb_idx | ! mapping_index . contains ( & nb_idx ) ) . collect ( ) }
Find the neighbours of the current vertex in the mapping sequence;
Ignore the neighbours if they have been in the mapping
Find the neighbours of the current vertex in the mapping sequence ; Ignore the neighbours if they have been in the mapping
vertex_index
usize
mapping_index
&Vec<usize>
vv
&core::graph::VertexVec<T>