Skip to content

Filp in/out edges for edgeMapReduce dense operations #86

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
s417-lama wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Filp in/out edges for edgeMapReduce dense operations #86

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
24 changes: 12 additions & 12 deletions gbbs/edge_map_reduce.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -153,8 +153,8 @@ inline vertexSubsetData<O> edgeMapCount_dense(Graph& GA, VS& vs, Cond& cond_f,
[&](size_t i) {
if (cond_f(i)) {
auto neighbors = (fl & in_edges)
? GA.get_vertex(i).in_neighbors()
: GA.get_vertex(i).out_neighbors();
? GA.get_vertex(i).out_neighbors()
: GA.get_vertex(i).in_neighbors();
size_t count = neighbors.count(count_f);

auto tup = std::make_tuple(i, count);
Expand All @@ -171,8 +171,8 @@ inline vertexSubsetData<O> edgeMapCount_dense(Graph& GA, VS& vs, Cond& cond_f,
[&](size_t i) {
if (cond_f(i)) {
auto neighbors = (fl & in_edges)
? GA.get_vertex(i).in_neighbors()
: GA.get_vertex(i).out_neighbors();
? GA.get_vertex(i).out_neighbors()
: GA.get_vertex(i).in_neighbors();
size_t count = neighbors.count(count_f);
auto tup = std::make_tuple(i, count);
if (count > 0) {
Expand Down Expand Up @@ -338,8 +338,8 @@ struct EdgeMap {
[&](size_t i) {
if (cond_f(i)) {
auto neighbors = (fl & in_edges)
? G.get_vertex(i).in_neighbors()
: G.get_vertex(i).out_neighbors();
? G.get_vertex(i).out_neighbors()
: G.get_vertex(i).in_neighbors();
M reduced_val = neighbors.reduce(map_f, red_monoid);
auto tup = std::make_tuple(i, reduced_val);
apply_f(tup);
Expand All @@ -360,8 +360,8 @@ struct EdgeMap {
}
if (cond_f(i)) {
auto neighbors = (fl & in_edges)
? G.get_vertex(i).in_neighbors()
: G.get_vertex(i).out_neighbors();
? G.get_vertex(i).out_neighbors()
: G.get_vertex(i).in_neighbors();
M reduced_val = neighbors.reduce(map_f, red_monoid);
auto tup = std::make_tuple(i, reduced_val);
auto applied_val = apply_f(tup);
Expand Down Expand Up @@ -469,8 +469,8 @@ struct EdgeMap {
parallel_for(0, n,
[&](size_t i) {
auto neighbors = (fl & in_edges)
? G.get_vertex(i).in_neighbors()
: G.get_vertex(i).out_neighbors();
? G.get_vertex(i).out_neighbors()
: G.get_vertex(i).in_neighbors();
size_t count = neighbors.count(count_f);
auto tup = std::make_tuple(i, count);
if (count > 0) {
Expand All @@ -484,8 +484,8 @@ struct EdgeMap {
parallel_for(0, n,
[&](size_t i) {
auto neighbors = (fl & in_edges)
? G.get_vertex(i).in_neighbors()
: G.get_vertex(i).out_neighbors();
? G.get_vertex(i).out_neighbors()
: G.get_vertex(i).in_neighbors();
size_t count = neighbors.count(count_f);
auto tup = std::make_tuple(i, count);
if (count > 0) {
Expand Down