41 nodes = (uint64_t *)malloc(N_NODES*2*
sizeof(uint64_t));
64 nodes = (uint64_t *)malloc(
N_NODES*2*
sizeof(uint64_t));
node_index_t starting_node
void data_to_input(int fd, void *vdata)
int check_data(void *vdata, void *vref)
int parse_uint64_t_array(char *s, uint64_t *arr, int n)
void bfs(node_t nodes[N_NODES], edge_t edges[N_EDGES], node_index_t starting_node, level_t level[N_NODES], edge_index_t level_counts[N_LEVELS])
void data_to_output(int fd, void *vdata)
int write_section_header(int fd)
int write_uint64_t_array(int fd, uint64_t *arr, int n)
void output_to_data(int fd, void *vdata)
void input_to_data(int fd, void *vdata)
char * find_section_start(char *s, int n)
void run_benchmark(void *vargs)
edge_index_t level_counts[N_LEVELS]