boost_mirror/graph
1
0
Fork 0
mirror of https://github.com/boostorg/graph.git synced 2025-05-09 23:14:00 +00:00
Code Issues Packages Projects Releases Wiki Activity

Generalize comments to be valid for any values of N and P

Browse Source
This commit is contained in:
Sven Gato Redsun 2023-05-07 22:02:19 -06:00
parent 05e099335a
commit 0182f7490e
3 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
test/bron_kerbosch_all_cliques.cpp
View File

@ -51,7 +51,7 @@ template < typename Graph > void test()
{
typedef erdos_renyi_iterator< boost::minstd_rand, Graph > er;
// Generate random graph with 20 vertices and 10% probability
// Generate random graph with N vertices and probability P
// of edge connection.
static const size_t N = 20;
static const double P = 0.1;

2
test/cycle_test.hpp
View File

@ -57,7 +57,7 @@ void test_one(Algorithm algorithm, std::size_t num_cycles_expected)
{
typedef erdos_renyi_iterator< minstd_rand, Graph > er;
// Generate random graph with 20 vertices and 10% probability
// Generate random graph with N vertices and probability P
// of edge connection.
static std::size_t const N = 20;
static double const P = 0.1;

2
test/tiernan_all_cycles.cpp
View File

@ -45,7 +45,7 @@ template < typename Graph > void test()
{
typedef erdos_renyi_iterator< boost::minstd_rand, Graph > er;
// Generate random graph with 20 vertices and 10% probability
// Generate random graph with N vertices and probability P
// of edge connection.
static const size_t N = 20;
static const double P = 0.1;