int traverseBFS(Graph graph, int start, Dllist close) {
Dllist node, queue;
JRB visited;
int *output;
int temp;
int i, n, counter = 0;
visited = make_jrb();
queue = new_dllist();
dll_append(queue, new_jval_i(start));
while(!dll_empty(queue)) {
node = dll_first(queue);
temp = jval_i(node->val);
dll_delete_node(node);
if(jrb_find_int(visited, temp) == NULL) {
counter++;
// reportFunc(temp);
jrb_insert_int(visited, temp, new_jval_i(temp));
n = outdegree(graph, temp, output);
for(i = 0; i < n; i++) {
if(jrb_find_int(visited, output[i]) == NULL) {
dll_append(queue, new_jval_i(output[i]));
}
}
}
}
return counter;
}
int deepFirstSearch(Graph graph, int start, int stop, Dllist close) {
Dllist node, stack;
JRB visited;
int output[100];
int temp;
int i, n;
visited = make_jrb();
stack = new_dllist();
dll_prepend(stack, new_jval_i(start));
while(!dll_empty(stack)) {
node = dll_first(stack);
temp = jval_i(node->val);
dll_delete_node(node);
if(jrb_find_int(visited, temp) == NULL) {
// reportFunc(temp);
dll_append(close, new_jval_i(temp));
jrb_insert_int(visited, temp, new_jval_i(temp));
if(compare(temp, stop) == 0) {
jrb_free_tree(visited);
free_dllist(stack);
return 1;
}
n = outdegree(graph, temp, output);
for(i = 0; i < n; i++) {
if(jrb_find_int(visited, output[i]) == NULL) {
dll_prepend(stack, new_jval_i(output[i]));
}
}
}
}
jrb_free_tree(visited);
free_dllist(stack);
return 0;
}
int UShortestPath(Graph graph, int start, int stop, Dllist close) {
Dllist node, queue, stackVisit;
JRB visited;
int output[100];
int temp;
int i, n;
visited = make_jrb();
queue = new_dllist();
stackVisit = new_dllist();
dll_append(queue, new_jval_i(start));
while(!dll_empty(queue)) {
node = dll_first(queue);
temp = jval_i(node->val);
dll_delete_node(node);
if(jrb_find_int(visited, temp) == NULL) {
jrb_insert_int(visited, temp, new_jval_i(temp));
dll_prepend(stackVisit, new_jval_i(temp));
if(temp == stop) {
return solution(graph, start, stop, stackVisit, close);
}
n = outdegree(graph, temp, output);
for(i = 0; i < n; i++) {
if(jrb_find_int(visited, output[i]) == NULL) {
dll_append(queue, new_jval_i(output[i]));
}
}
}
}
return -1;
}
static void
validate(graph_t * g)
{
node_t *n;
edge_t *e;
int i, cnt;
cnt = 0;
for (n = GD_nlist(g);n; n = ND_next(n)) {
assert(outdegree(g,n) == ND_out(n).size);
for (i = 0; (e = ND_out(n).list[i]); i++) {
assert(agtail(e) == n);
assert( e == agfindedge(g, n, aghead(e)));
}
assert(indegree(g,n) == ND_in(n).size);
for (i = 0; (e = ND_in(n).list[i]); i++) {
assert(aghead(e) == n);
assert( e == agfindedge(g, agtail(e), n));
}
cnt++;
}
assert (agnnodes(g) == cnt);
}
