SIZED2
SIZED2(_check_duplicates)(struct nbperf *nbperf, struct SIZED(graph) *graph)
SIZED2(_add_edge)(struct SIZED(graph) *graph, uint32_t edge)
SIZED2(_remove_edge)(struct SIZED(graph) *graph, uint32_t edge)
SIZED2(_remove_vertex)(struct SIZED(graph) *graph, uint32_t vertex)
SIZED2(_remove_edge)(graph, e);
SIZED2(_hash)(struct nbperf *nbperf, struct SIZED(graph) *graph)
SIZED2(_add_edge)(graph, i);
return SIZED2(_check_duplicates)(nbperf, graph);
SIZED2(_remove_vertex)(graph, i);
SIZED2(_remove_vertex)(graph, e2->vertices[j]);
SIZED2(_setup)(struct SIZED(graph) *graph, uint32_t v, uint32_t e)
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);
if (SIZED2(_hash)(nbperf, &state.graph))
if (SIZED2(_output_order)(&state.graph))
SIZED2(_free)(&state.graph);
SIZED2(_setup)(&state.graph, v, e);
if (SIZED2(_hash)(nbperf, &state.graph))
if (SIZED2(_output_order)(&state.graph))
SIZED2(_free)(&state.graph);