|
Graybat
1.1
Graph Approach for Highly Generic Communication Schemes Based on Adaptive Topologies
|
#include <GraphPartition.hpp>
Public Member Functions | |
| GraphPartition (unsigned nParts) | |
| template<typename T_Graph > | |
| std::pair< std::vector< idx_t >, std::vector< idx_t > > | toCompressedRowStorage (T_Graph &graph) |
| template<typename T_Graph > | |
| std::vector< typename T_Graph::Vertex > | operator() (const unsigned processID, const unsigned processCount, T_Graph &graph) |
Partitioning of the communication graph into k parts. k is set either to the number of peers that want to take part in communication or is given as an input parameter.
| nParts | number of parts to partition |
|
inline |
Translates the graph into the compressed row storage format (CSR) which can be parsed by Metis.
http://en.wikipedia.org/wiki/Sparse_matrix#Compressed_row_Storage_.28CRS_or_CSR.29