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

Graph constructor function specialization. More...

Detailed Description

template<unsigned int dim, int lin_id, typename Graph, typename T, unsigned int dim_c, int... pos>
class Graph_constructor_impl< dim, lin_id, 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 397 of file CartesianGraphFactory.hpp.

#include <CartesianGraphFactory.hpp>

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

Member Function Documentation

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

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

inlinestatic

Construct a cartesian graph.

Parameters

sz	size of the partesian graph
dom	domain where this cartesian graph is defined (used to fill the coordinates)
bc	boundary conditions (torus or cube)

Returns

the constructed graph

Construct an hyper-cube of dimension dim

Graph to construct

Construct a key iterator

Iterate through all the elements

Definition at line 410 of file CartesianGraphFactory.hpp.

---

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

• src/Graph/CartesianGraphFactory.hpp