SIZED
SIZED2(_check_duplicates)(struct nbperf *nbperf, struct SIZED(graph) *graph)
SIZED2(_add_edge)(struct SIZED(graph) *graph, uint32_t edge)
struct SIZED(edge) *e = graph->edges + edge;
struct SIZED(vertex) *v;
SIZED2(_remove_edge)(struct SIZED(graph) *graph, uint32_t edge)
struct SIZED(edge) *e = graph->edges + edge;
struct SIZED(vertex) *v;
SIZED2(_remove_vertex)(struct SIZED(graph) *graph, uint32_t vertex)
struct SIZED(vertex) *v = graph->verts + vertex;
SIZED2(_hash)(struct nbperf *nbperf, struct SIZED(graph) *graph)
struct SIZED(edge) *e;
SIZED2(_output_order)(struct SIZED(graph) *graph)
struct SIZED(edge) *e2;
SIZED2(_setup)(struct SIZED(graph) *graph, uint32_t v, uint32_t e)
SIZED2(_free)(struct SIZED(graph) *graph)
static struct SIZED(graph) *sorting_graph;
const struct SIZED(edge) *ea = &sorting_graph->edges[*a],
struct SIZED(vertex) {
struct SIZED(edge) {
struct SIZED(graph) {
struct SIZED(vertex) *verts;
struct SIZED(edge) *edges;
void SIZED2(_setup)(struct SIZED(graph) *, uint32_t, uint32_t);
void SIZED2(_free)(struct SIZED(graph) *);
int SIZED2(_hash)(struct nbperf *, struct SIZED(graph) *);
int SIZED2(_output_order)(struct SIZED(graph) *graph);
struct SIZED(graph) graph;
struct SIZED(edge) *e;
struct SIZED(edge) *e;
struct SIZED(graph) graph;
struct SIZED(edge) *e;