This class construct a cartesian graph. More...
This class construct a cartesian graph.
This class construct a cartesian graph
dim | dimensionality of the cartesian grid |
Definition at line 507 of file CartesianGraphFactory.hpp.
#include <CartesianGraphFactory.hpp>
Static Public Member Functions | |
template<int se, int id_prp, typename T , unsigned int dim_c, int ... pos> | |
static Graph | construct (const size_t(&sz)[dim], Box< dim, T > &dom, const size_t(&bc)[dim]) |
Construct a cartesian graph, with V and E edge properties. | |
|
inlinestatic |
Construct a cartesian graph, with V and E edge properties.
Construct a cartesian graph, with V and E edge properties
Each vertex is a subspace (Hyper-cube) of dimension dim, each vertex is connected with an edge if two vertex (Hyper-cube) share a element of dimension grater than dim_c. One property can be used to store the contact size or the d-dimensional surface in common between two connected hyper-cube.
se | Indicate which properties fill with the contact size. The contact size is the point, line , surface, d-dimensional object size in contact (in common) between two hyper-cube. NO_EDGE indicate no property will store this information |
id_prp | property 'id' that stores the vertex id (with -1 it skip) |
T | type of the domain like (int real complex ... ) |
dim_c | Connectivity dimension |
pos... | (optional)one or more integer indicating the spatial properties |
sz | store the size of the cartesian grid on each dimension |
dom | Box enclosing the physical domain |
bc | boundary conditions {PERIODIC = torus and NON_PERIODIC = cube} |
Definition at line 540 of file CartesianGraphFactory.hpp.