boostorg / boostorg/boost

Scalable RMAT Generator Example Code Not Working

Open
#961 0 comments 0 reactions 0 assignees View on GitHub
Dominant language
HTML
Stars
8.6k
Forks
1.9k
Avg merge
39m
Merged PRs (30d)
2

Description

Hi,
I am trying to follow the instructions here https://live.boost.org/doc/libs/1_86_0/libs/graph_parallel/doc/html/scalable_rmat_generator.html

but the issue is that example code does not work :
```
#include
#include
#include
#include

using boost::graph::distributed::mpi_process_group;

typedef compressed_sparse_row_graph > Graph;
typedef boost::scalable_rmat_iterator RMATGen;

int main()
{
boost::minstd_rand gen;
mpi_process_group pg;

int N = 100;

boost::parallel::variant_distribution distrib
= boost::parallel::block(pg, N);

// Create graph with 100 nodes and 400 edges
Graph g(RMATGen(pg, distrib, gen, N, 400, 0.57, 0.19, 0.19, 0.05),
RMATGen(), N, pg, distrib);
return 0;
}
```

First it complained that `#include ` was missing and then bunch of variables needed namespace like `boost::directedS` but then `ProcessGroup` complained that it does not exist and this function template requires 4 arguments but received 2 error `typedef boost::scalable_rmat_iterator`

I would like to get help to make this code including all missing parts to get it working.
Thank you in advance

Contributor guide

No contributing guide indexed for this repository

Research direction

Start with the scalable RMAT generator example in scalable_rmat_generator.html and compile the pasted code with Boost Graph Parallel and MPI enabled. Compare each reported missing declaration and template argument with the current APIs; done means the documented example compiles and runs as described.

Written by the indexing model from the issue text.

Assessment

Tech stack
cpp
Domain
distributed-systems, documentation
Issue type
Documentation
Difficulty
3/5
Estimated time
1-2 days
Activity status
Stale
Clarity
Mostly clear
Newbie friendliness
38/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.