For a given ordering, this stores later neighbors and earlier neighbors for a given vertex in arrays. More...
#include <degeneracy_helper.h>
Data Fields | |
int | vertex |
the vertex that owns this neighbor list | |
int * | earlier |
an array of neighbors that come before this vertex in an ordering | |
int | earlierDegree |
the number of neighbors in earlier | |
int * | later |
an array of neighbors that come after this vertex in an ordering | |
int | laterDegree |
an array of neighbors that come after this vertex in an ordering | |
int | orderNumber |
the position of this verex in the ordering |
For a given ordering, this stores later neighbors and earlier neighbors for a given vertex in arrays.
This version of the NeighborList structure is more cache efficient.
int* earlier |
an array of neighbors that come before this vertex in an ordering
int earlierDegree |
the number of neighbors in earlier
int* later |
an array of neighbors that come after this vertex in an ordering
int laterDegree |
an array of neighbors that come after this vertex in an ordering
int orderNumber |
the position of this verex in the ordering
int vertex |
the vertex that owns this neighbor list