Skip to content
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.

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

Feature/edge list writer #245

Merged
merged 2 commits into from
Jan 16, 2023
Merged

Feature/edge list writer #245

merged 2 commits into from
Jan 16, 2023

Conversation

EnverAtahan
Copy link
Collaborator

EdgeListWriter class is added.
Added doxygen style documentation.
Tests for EdgeListWriter are added.

@ardasener ardasener changed the base branch from main to develop December 18, 2022 18:58
}
edges.push_back(std::tuple<IDType, IDType>(u, v));
}
sort(edges.begin(), edges.end(),
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

On the reader, this code ensures that there are no duplicates in the COO. For the writer, we can probably assume, there won't be any duplicates and the COO is sorted as that is the default behavior of the library. So the sort, the unique operator, and the erase could possibly be removed. A better approach is adding a parameter that can toggle them, like remove_duplicates.

Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Same for all the other sort, unique, erase codes

Copy link
Contributor

@ardasener ardasener left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Overall very good. We just need to fix the thing I mentioned in the comment.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

None yet

2 participants