Skip to content

[FEA] Sort adjacency array #20

Open
Open
[FEA] Sort adjacency array#20
Labels
0 - BacklogHORNET Repocode goes into the Hornet repocudaCUDA code needs to be developedfeatureNew feature or request

Description

@ogreen
ogreen
opened on 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.

Activity

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Metadata

Assignees

No one assigned

    Labels

    0 - BacklogHORNET Repocode goes into the Hornet repocudaCUDA code needs to be developedfeatureNew feature or request

    Type

    No type

    Projects

    No projects

      Milestone

      No milestone

      Relationships

      None yet

      Development

      No branches or pull requests

      Issue actions