Skip to content

Validation of random graph construction #7

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
ehein6 wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Validation of random graph construction #7

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
31 changes: 31 additions & 0 deletions benchmark/bench_graphConstruct/graphconstruct.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -8,6 +8,7 @@
#include "perf.h"
#include "openG.h"
#include "omp.h"
#include <algorithm>
#ifdef SIM
#include "SIM.h"
#endif
Expand Down Expand Up @@ -112,6 +113,36 @@ void parallel_randomgraph_construction(graph_t &g, size_t vertex_num, size_t edg
#endif

}

cout << "Validating random graph...";
// Check to make sure the graph was constructed correctly
vector<pair<size_t, size_t>> actual_edges;
actual_edges.reserve(edge_num);

for (vertex_iterator vit = g.vertices_begin(); vit != g.vertices_end(); ++vit)
{
for (edge_iterator eit = vit->out_edges_begin(); eit != vit->out_edges_end(); ++eit)
{
actual_edges.push_back(make_pair(vit->id(), eit->target()));
}
}

std::sort(edges.begin(), edges.end());
std::sort(actual_edges.begin(), actual_edges.end());

bool match = true;
if (edges.size() != actual_edges.size()) {
match = false;
} else {
auto mismatch = std::mismatch(edges.begin(), edges.end(), actual_edges.begin());
if (mismatch.first != edges.end()) {
match = false;
}
}

if (match) { cout << "OK\n"; }
else { cout << "FAIL\n"; }

}

//==============================================================//
Expand Down