Graybat  1.1
Graph Approach for Highly Generic Communication Schemes Based on Adaptive Topologies
graybat::mapping::Random Struct Reference

#include <Random.hpp>

Public Member Functions

 Random (int seed)
 
template<typename T_Graph >
std::vector< typename T_Graph::Vertex > operator() (const unsigned processID, const unsigned processCount, T_Graph &graph)
 

Detailed Description

Random distribution of vertices of the graph to the the peers. All peers need to set the same random seed. Thus, all peers have the same random base. Therefore seeds that depend on varying parameters like time or pid or not applicable here.

Parameters
seedstatic random seed for all peers
Returns
random set of vertices of the graph

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