Skip to content

Commit dbaf827

Browse files
Fix format broken by others.
1 parent 00b4b3c commit dbaf827

3 files changed

Lines changed: 14 additions & 16 deletions

File tree

lonestar/analytics/cpu/bipart/Coarsening.cpp

Lines changed: 10 additions & 11 deletions
Original file line numberDiff line numberDiff line change
@@ -177,7 +177,7 @@ void parallelHMatchAndCreateNodes(MetisGraph* graph, int iter, GNodeBag& bag,
177177
galois::GAccumulator<unsigned> hedge;
178178
// hyperedge coarsening
179179

180-
galois::InsertBag<GNode> hedge_bag;
180+
galois::InsertBag<GNode> hedge_bag;
181181

182182
galois::do_all(
183183
galois::iterate(size_t{0}, fineGGraph->hedges),
@@ -215,8 +215,8 @@ void parallelHMatchAndCreateNodes(MetisGraph* graph, int iter, GNodeBag& bag,
215215
return;
216216
fineGGraph->getData(item).setMatched();
217217
if (flag)
218-
hedge_bag.push(item);
219-
// hedges[item] = true;
218+
hedge_bag.push(item);
219+
// hedges[item] = true;
220220
bag.push(nodeid);
221221
unsigned ww = 0;
222222
for (auto pp : edges) {
@@ -230,8 +230,8 @@ void parallelHMatchAndCreateNodes(MetisGraph* graph, int iter, GNodeBag& bag,
230230
},
231231
galois::loopname("phaseI"));
232232

233-
for(auto item: hedge_bag)
234-
hedges[item] = true;
233+
for (auto item : hedge_bag)
234+
hedges[item] = true;
235235
}
236236

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

347347
} else {
348348
hedge_bag.push(item);
349-
fineGGraph->getData(item).setMatched();
349+
fineGGraph->getData(item).setMatched();
350350
}
351351
},
352352
galois::loopname("count # Hyperedges"));
353353

354-
for(auto item: hedge_bag)
355-
hedges[item] = true;
354+
for (auto item : hedge_bag)
355+
hedges[item] = true;
356356
}
357357

358358
void parallelCreateEdges(MetisGraph* graph, GNodeBag& bag,
@@ -383,7 +383,7 @@ void parallelCreateEdges(MetisGraph* graph, GNodeBag& bag,
383383
},
384384
galois::steal(), galois::loopname("noedgebag match"));
385385
unsigned hnum = hg.reduce();
386-
unsigned nodes = std::distance(bag.begin(), bag.end());
386+
unsigned nodes = std::distance(bag.begin(), bag.end());
387387
unsigned newval = hnum;
388388
std::vector<unsigned> idmap(fineGGraph->hnodes);
389389
std::vector<unsigned> newrand(nodes);
@@ -469,8 +469,7 @@ void parallelCreateEdges(MetisGraph* graph, GNodeBag& bag,
469469
coarseGGraph->getData(ii).netval = INT_MAX;
470470
coarseGGraph->getData(ii).netnum = INT_MAX;
471471
coarseGGraph->getData(ii).netrand = INT_MAX;
472-
coarseGGraph->getData(ii).nodeid =
473-
ii;
472+
coarseGGraph->getData(ii).nodeid = ii;
474473
coarseGGraph->getData(ii).setWeight(
475474
newWeight[ii - coarseGGraph->hedges]);
476475
}

lonestar/analytics/cpu/louvain-partitioning/louvain-partitioning.h

Lines changed: 2 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -202,9 +202,8 @@ double calModularityDelay(GraphTy& graph, double& e_xx,
202202
}
203203
});
204204

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

209208
e_xx = acc_e_xx.reduce();
210209

lonestar/libdistbench/src/Input.cpp

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -37,8 +37,8 @@ cll::opt<std::string> inputFileTranspose("graphTranspose",
3737
cll::init(""));
3838
cll::opt<bool>
3939
symmetricGraph("symmetricGraph",
40-
cll::desc("Specify that the input graph is symmetric"),
41-
cll::init(false));
40+
cll::desc("Specify that the input graph is symmetric"),
41+
cll::init(false));
4242

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

0 commit comments

Comments
 (0)