DistGraph_constr_impl< dim, Graph, NO_EDGE, T, dim_c, pos...> Class Template Reference

Graph constructor function specialization. More...

Detailed Description

template<unsigned int dim, typename Graph, typename T, unsigned int dim_c, int... pos>
class DistGraph_constr_impl< dim, Graph, NO_EDGE, T, dim_c, pos...>

Graph constructor function specialization.

On C++ partial function specialization is not allowed, so we need a class to do it This specialization handle the case when we have NO_EDGE option active

See Also

CartesianGraphFactory method construct

Definition at line 391 of file DistGraphFactory.hpp.

#include <DistGraphFactory.hpp>

Static Public Member Functions
static Graph	construct (const size_t(&sz)[dim], Box< dim, T > dom)
	Construct Cartesian graph. More...

Member Function Documentation

template<unsigned int dim, typename Graph , typename T , unsigned int dim_c, int... pos>

static Graph DistGraph_constr_impl< dim, Graph, NO_EDGE, T, dim_c, pos...>::construct ( const size_t(&)  sz[dim], Box< dim, T >  dom  )

inlinestatic

Construct Cartesian graph.

Construct an hyper-cube of dimension dim

Get the processor id

Get the number of processing units

Division of vertices in Np graphs Put (div+1) vertices in mod graphs Put div vertices in the rest of the graphs

Distribution vector

Graph to construct

Store the decomposition vector inside the distributed graph

Construct a key iterator

Local iterator of the graph

Iterate through all the elements

Definition at line 395 of file DistGraphFactory.hpp.

---

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

• src/Graph/DistGraphFactory.hpp