DNDSR 0.1.0.dev1+gcd065ad
Distributed Numeric Data Structure for CFV
Loading...
Searching...
No Matches
SerialAdjReordering.hpp File Reference
#include "Geometric.hpp"
#include "CorrectRCM.hpp"
#include "Metis.hpp"
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/graph_utility.hpp>
#include <boost/graph/minimum_degree_ordering.hpp>
#include <boost/graph/cuthill_mckee_ordering.hpp>
#include <boost/graph/properties.hpp>
#include <boost/graph/bandwidth.hpp>
Include dependency graph for SerialAdjReordering.hpp:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes

class  DNDS::Geom::OffsetIterator< T >
 
class  DNDS::Geom::OffsetRange< T >
 

Namespaces

namespace  DNDS
 the host side operators are provided as implemented
 
namespace  DNDS::Geom
 

Functions

auto DNDS::Geom::PartitionSerialAdj_Metis (tLocalMatStruct::const_iterator mat_begin, tLocalMatStruct::const_iterator mat_end, int nPart, index ind_offset=0, std::string metisType="KWAY", int metisNcuts=3, int metisUfactor=5, int metisSeed=0)
 Partition a (sub-)graph using Metis.
 
std::pair< std::vector< index >, std::vector< index > > DNDS::Geom::ReorderSerialAdj_Metis (const tLocalMatStruct &mat)
 
std::pair< std::vector< index >, std::vector< index > > DNDS::Geom::ReorderSerialAdj_BoostMMD (const tLocalMatStruct &mat)
 
std::pair< std::vector< index >, std::vector< index > > DNDS::Geom::ReorderSerialAdj_BoostRCM (const tLocalMatStruct &mat, index &bandWidthOld, index &bandWidthNew)
 
std::pair< std::vector< index >, std::vector< index > > DNDS::Geom::ReorderSerialAdj_CorrectRCM (tLocalMatStruct::const_iterator mat_begin, tLocalMatStruct::const_iterator mat_end, index &bandWidthOld, index &bandWidthNew, index offset=0)
 
std::vector< indexDNDS::Geom::ReorderSerialAdj_PartitionMetisC (tLocalMatStruct::iterator mat_begin, tLocalMatStruct::iterator mat_end, std::vector< index >::iterator i_new2old_begin, std::vector< index >::iterator i_new2old_end, int nParts, index ind_offset, bool do_rcm, index &bwOldM, index &bwNewM, tLocalMatStruct::iterator full_mat_begin, index full_n_elem)
 Partition a sub-graph into nParts and optionally apply RCM reordering within each part.