#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>

#include "graph.h"

#define NTHREADS 1

void dfs(node* n){
    if(n->touched)
	return;
    n->touched = true;
    n->threadID = 0;
    for(int i = 0; i < BRANCHING; i++){
	node* nextNode = n->next[i];
	dfs(nextNode);
    }

}

int main(int argc, char** argv){
    graph* g = build_graph(700);
    dfs(g->graph[0]);
    print_tags(g, NTHREADS);
    destroy_graph(g);
    return 0;

}