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.

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

Jump to bottom

[FEA] Sort adjacency array #20

Open
ogreen opened this issue Jan 8, 2019 · 0 comments
Open

[FEA] Sort adjacency array #20

ogreen opened this issue Jan 8, 2019 · 0 comments
Labels
0 - Backlog cuda CUDA code needs to be developed feature New feature or request HORNET Repo code goes into the Hornet repo

Comments

@ogreen
Copy link

ogreen commented Jan 8, 2019

Sorted adjacency lists are needed for numerous applications: triangle counting, K-Truss.
Sorting can also be useful for updating a graph as it is easier to lookup values.

Each of the adjacency arrays needs to be sorted.
@ogreen ogreen added feature New feature or request cuda CUDA code needs to be developed 0 - Backlog HORNET Repo code goes into the Hornet repo labels Jan 8, 2019
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
0 - Backlog cuda CUDA code needs to be developed feature New feature or request HORNET Repo code goes into the Hornet repo
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@ogreen