DistGraph_CSR< V, E, Memory, layout_v, layout_e, layout_v_base, layout_e_base, grow_p >::SendGraphPack Struct Reference

Struct containing the (sub)graph to send. More...

Detailed Description

template<typename V, typename E = no_edge, typename Memory = HeapMemory, typename layout_v = typename memory_traits_lin<V>::type, typename layout_e = typename memory_traits_lin<E>::type, template< typename > class layout_v_base = memory_traits_lin, template< typename > class layout_e_base = memory_traits_lin, typename grow_p = openfpm::grow_policy_double>
struct DistGraph_CSR< V, E, Memory, layout_v, layout_e, layout_v_base, layout_e_base, grow_p >::SendGraphPack

Struct containing the (sub)graph to send.

Definition at line 254 of file dist_map_graph.hpp.

Data Fields
openfpm::vector< V >	send_v
	vertex send buffer
openfpm::vector< v_info >	send_v_m
	vertex info send buffer
openfpm::vector< E >	send_e
	edge send buffer
openfpm::vector< e_info >	send_e_m
	edge info send buffer
openfpm::vector< size_t >	send_el
	For each edge contain the child vertex id.
openfpm::vector< size_t >	send_es
	For each vertex contain the number of children.
bool	isEmpty = true
	Indicates if the pack is empty or not.

Field Documentation

isEmpty

template<typename V , typename E = no_edge, typename Memory = HeapMemory, typename layout_v = typename memory_traits_lin<V>::type, typename layout_e = typename memory_traits_lin<E>::type, template< typename > class layout_v_base = memory_traits_lin, template< typename > class layout_e_base = memory_traits_lin, typename grow_p = openfpm::grow_policy_double>

bool DistGraph_CSR< V, E, Memory, layout_v, layout_e, layout_v_base, layout_e_base, grow_p >::SendGraphPack::isEmpty = true

Indicates if the pack is empty or not.

Definition at line 269 of file dist_map_graph.hpp.

send_e

template<typename V , typename E = no_edge, typename Memory = HeapMemory, typename layout_v = typename memory_traits_lin<V>::type, typename layout_e = typename memory_traits_lin<E>::type, template< typename > class layout_v_base = memory_traits_lin, template< typename > class layout_e_base = memory_traits_lin, typename grow_p = openfpm::grow_policy_double>

openfpm::vector<E> DistGraph_CSR< V, E, Memory, layout_v, layout_e, layout_v_base, layout_e_base, grow_p >::SendGraphPack::send_e

edge send buffer

Definition at line 261 of file dist_map_graph.hpp.

send_e_m

template<typename V , typename E = no_edge, typename Memory = HeapMemory, typename layout_v = typename memory_traits_lin<V>::type, typename layout_e = typename memory_traits_lin<E>::type, template< typename > class layout_v_base = memory_traits_lin, template< typename > class layout_e_base = memory_traits_lin, typename grow_p = openfpm::grow_policy_double>

openfpm::vector<e_info> DistGraph_CSR< V, E, Memory, layout_v, layout_e, layout_v_base, layout_e_base, grow_p >::SendGraphPack::send_e_m

edge info send buffer

Definition at line 263 of file dist_map_graph.hpp.

send_el

template<typename V , typename E = no_edge, typename Memory = HeapMemory, typename layout_v = typename memory_traits_lin<V>::type, typename layout_e = typename memory_traits_lin<E>::type, template< typename > class layout_v_base = memory_traits_lin, template< typename > class layout_e_base = memory_traits_lin, typename grow_p = openfpm::grow_policy_double>

openfpm::vector<size_t> DistGraph_CSR< V, E, Memory, layout_v, layout_e, layout_v_base, layout_e_base, grow_p >::SendGraphPack::send_el

For each edge contain the child vertex id.

Definition at line 265 of file dist_map_graph.hpp.

send_es

template<typename V , typename E = no_edge, typename Memory = HeapMemory, typename layout_v = typename memory_traits_lin<V>::type, typename layout_e = typename memory_traits_lin<E>::type, template< typename > class layout_v_base = memory_traits_lin, template< typename > class layout_e_base = memory_traits_lin, typename grow_p = openfpm::grow_policy_double>

openfpm::vector<size_t> DistGraph_CSR< V, E, Memory, layout_v, layout_e, layout_v_base, layout_e_base, grow_p >::SendGraphPack::send_es

For each vertex contain the number of children.

Definition at line 267 of file dist_map_graph.hpp.

send_v

template<typename V , typename E = no_edge, typename Memory = HeapMemory, typename layout_v = typename memory_traits_lin<V>::type, typename layout_e = typename memory_traits_lin<E>::type, template< typename > class layout_v_base = memory_traits_lin, template< typename > class layout_e_base = memory_traits_lin, typename grow_p = openfpm::grow_policy_double>

openfpm::vector<V> DistGraph_CSR< V, E, Memory, layout_v, layout_e, layout_v_base, layout_e_base, grow_p >::SendGraphPack::send_v

vertex send buffer

Definition at line 257 of file dist_map_graph.hpp.

send_v_m

template<typename V , typename E = no_edge, typename Memory = HeapMemory, typename layout_v = typename memory_traits_lin<V>::type, typename layout_e = typename memory_traits_lin<E>::type, template< typename > class layout_v_base = memory_traits_lin, template< typename > class layout_e_base = memory_traits_lin, typename grow_p = openfpm::grow_policy_double>

openfpm::vector<v_info> DistGraph_CSR< V, E, Memory, layout_v, layout_e, layout_v_base, layout_e_base, grow_p >::SendGraphPack::send_v_m

vertex info send buffer

Definition at line 259 of file dist_map_graph.hpp.

---

The documentation for this struct was generated from the following file:

• src/Graph/dist_map_graph.hpp