Skip to content

Commit

Permalink
Merge pull request #354 from insertinterestingnamehere/clustering
Browse files Browse the repository at this point in the history
Disable Louvain partitioning test in CI.
  • Loading branch information
insertinterestingnamehere authored Aug 20, 2020
2 parents 47db406 + dbaf827 commit 903b79d
Show file tree
Hide file tree
Showing 4 changed files with 15 additions and 17 deletions.
21 changes: 10 additions & 11 deletions lonestar/analytics/cpu/bipart/Coarsening.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -177,7 +177,7 @@ void parallelHMatchAndCreateNodes(MetisGraph* graph, int iter, GNodeBag& bag,
galois::GAccumulator<unsigned> hedge;
// hyperedge coarsening

galois::InsertBag<GNode> hedge_bag;
galois::InsertBag<GNode> hedge_bag;

galois::do_all(
galois::iterate(size_t{0}, fineGGraph->hedges),
Expand Down Expand Up @@ -215,8 +215,8 @@ void parallelHMatchAndCreateNodes(MetisGraph* graph, int iter, GNodeBag& bag,
return;
fineGGraph->getData(item).setMatched();
if (flag)
hedge_bag.push(item);
// hedges[item] = true;
hedge_bag.push(item);
// hedges[item] = true;
bag.push(nodeid);
unsigned ww = 0;
for (auto pp : edges) {
Expand All @@ -230,8 +230,8 @@ void parallelHMatchAndCreateNodes(MetisGraph* graph, int iter, GNodeBag& bag,
},
galois::loopname("phaseI"));

for(auto item: hedge_bag)
hedges[item] = true;
for (auto item : hedge_bag)
hedges[item] = true;
}

void moreCoarse(MetisGraph* graph, std::vector<unsigned>& weight) {
Expand Down Expand Up @@ -346,13 +346,13 @@ void coarsePhaseII(MetisGraph* graph, std::vector<bool>& hedges,

} else {
hedge_bag.push(item);
fineGGraph->getData(item).setMatched();
fineGGraph->getData(item).setMatched();
}
},
galois::loopname("count # Hyperedges"));

for(auto item: hedge_bag)
hedges[item] = true;
for (auto item : hedge_bag)
hedges[item] = true;
}

void parallelCreateEdges(MetisGraph* graph, GNodeBag& bag,
Expand Down Expand Up @@ -383,7 +383,7 @@ void parallelCreateEdges(MetisGraph* graph, GNodeBag& bag,
},
galois::steal(), galois::loopname("noedgebag match"));
unsigned hnum = hg.reduce();
unsigned nodes = std::distance(bag.begin(), bag.end());
unsigned nodes = std::distance(bag.begin(), bag.end());
unsigned newval = hnum;
std::vector<unsigned> idmap(fineGGraph->hnodes);
std::vector<unsigned> newrand(nodes);
Expand Down Expand Up @@ -469,8 +469,7 @@ void parallelCreateEdges(MetisGraph* graph, GNodeBag& bag,
coarseGGraph->getData(ii).netval = INT_MAX;
coarseGGraph->getData(ii).netnum = INT_MAX;
coarseGGraph->getData(ii).netrand = INT_MAX;
coarseGGraph->getData(ii).nodeid =
ii;
coarseGGraph->getData(ii).nodeid = ii;
coarseGGraph->getData(ii).setWeight(
newWeight[ii - coarseGGraph->hedges]);
}
Expand Down
2 changes: 1 addition & 1 deletion lonestar/analytics/cpu/louvain-partitioning/CMakeLists.txt
Original file line number Diff line number Diff line change
Expand Up @@ -2,4 +2,4 @@ add_executable(louvain-partitioning-cpu louvain-partitioning.cpp serial-partitio
add_dependencies(apps louvain-partitioning-cpu)
target_link_libraries(louvain-partitioning-cpu PRIVATE Galois::shmem lonestar)
install(TARGETS louvain-partitioning-cpu DESTINATION "${CMAKE_INSTALL_BINDIR}" COMPONENT apps EXCLUDE_FROM_ALL)
add_test_scale(small1 louvain-partitioning-cpu -symmetricGraph "${BASEINPUT}/scalefree/symmetric/rmat10.sgr")
add_test_scale(small1 louvain-partitioning-cpu -symmetricGraph "${BASEINPUT}/scalefree/symmetric/rmat10.sgr" NOT_QUICK)
Original file line number Diff line number Diff line change
Expand Up @@ -202,9 +202,8 @@ double calModularityDelay(GraphTy& graph, double& e_xx,
}
});

galois::do_all(galois::iterate(graph), [&](GNode n) {
acc_e_xx += cluster_wt_internal[n];
});
galois::do_all(galois::iterate(graph),
[&](GNode n) { acc_e_xx += cluster_wt_internal[n]; });

e_xx = acc_e_xx.reduce();

Expand Down
4 changes: 2 additions & 2 deletions lonestar/libdistbench/src/Input.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -37,8 +37,8 @@ cll::opt<std::string> inputFileTranspose("graphTranspose",
cll::init(""));
cll::opt<bool>
symmetricGraph("symmetricGraph",
cll::desc("Specify that the input graph is symmetric"),
cll::init(false));
cll::desc("Specify that the input graph is symmetric"),
cll::init(false));

cll::opt<PARTITIONING_SCHEME> partitionScheme(
"partition", cll::desc("Type of partitioning."),
Expand Down

0 comments on commit 903b79d

Please sign in to comment.