![]() |
fpmas 1.6
|
#include <uniform_graph_builder.h>
Public Member Functions | |
template<typename EdgeDist > | |
DistributedUniformGraphBuilder (random::DistributedGenerator<> &generator, EdgeDist &distribution) | |
template<typename EdgeDist > | |
DistributedUniformGraphBuilder (EdgeDist &distribution) | |
std::vector< api::graph::DistributedNode< T > * > | build (api::graph::DistributedNodeBuilder< T > &node_builder, api::graph::LayerId layer, api::graph::DistributedGraph< T > &graph) override |
virtual std::vector< api::graph::DistributedNode< T > * > | build (DistributedNodeBuilder< T > &node_builder, LayerId layer, DistributedGraph< T > &graph)=0 |
Distributed version of the UniformGraphBuilder.
The DistributedUniformGraphBuilder should generally be used, since it has been proved to achieve much better performances.
|
inline |
DistributedUniformGraphBuilder constructor.
EdgeDist | edge count distribution (must satisfy RandomNumberDistribution) |
generator | random number generator provided to the distribution |
distribution | random distribution that manages edges generation. See build() |
|
inline |
DistributedUniformGraphBuilder constructor.
The RandomGraphBuilder::distributed_rd random generator is used. It can be seeded with RandomGraphBuilder::seed() or fpmas::seed().
EdgeDist | edge count distribution (must satisfy RandomNumberDistribution) |
distribution | random distribution that manages edges generation. See build() |
|
overridevirtual |
Same as UniformGraphBuilder::build(), but distributed and much more efficient.
This process is synchronous and should be called from all processes.
node_builder | DistributedNodeBuilder instance used to generate nodes |
layer | layer on which nodes will be linked |
graph | graph in which nodes and edges will be inserted |
Implements fpmas::api::graph::DistributedGraphBuilder< T >.