#include "typedefs.hpp"#include "cl_Cell.hpp"#include "cl_DynamicBitset.hpp"#include "cl_Vector.hpp"#include "cl_Graph_Vertex.hpp"#include "op_Graph_Vertex_Index.hpp"#include "commtools.hpp"Go to the source code of this file.
Namespaces | |
| namespace | belfem |
| USER GUIDES: | |
| namespace | belfem::graph |
Functions | |
| template<typename T> | |
| void | belfem::graph::apply_graph_permutation (Graph &aGraph, const Vector< T > &aPermutation) |
| template<typename T> | |
| void | belfem::graph::build_graph_adjacency (Graph &aGraph, Vector< T > &aVertices, Vector< T > &aEdges) |
| void | belfem::graph::block_distribution (Graph &aGraph, const proc_t aCommSize) |
| assign owners to an ownerless graph in contiguous blocks of graph order: the first aCommSize - ( N mod aCommSize ) ranks take N / aCommSize vertices, the remaining ranks one more ( the split DistMatrix uses for its rows ). | |
| template<typename T> | |
| void | belfem::graph::build_pargraph_adjacency (Graph &aGraph, Vector< T > &aDistribution, Cell< Vector< T > > &aVertices, Cell< Vector< T > > &aEdges) |