-void oldbfs(void)
-{
- printf("Starting outer BFS\n");
- printf("There are %u buffered lines and %d eges\n", GARY_SIZE(buffer_line), num_edges_dbg);
-
- GARY_INIT(bfs_queue, 0);
- GARY_INIT(longlines, 0);
-
- int dbg_bfs_continues = 0;
-
- HASH_FOR_ALL(hash, node)
- {
- // FIXME: Skip if visited node
-
- for (uns i=0; i<GARY_SIZE(node->edges); i++)
- {
- struct graph_edge *e = node->edges[i];
-
- if (e->visited) continue;
-
- // BFS itself
- for (uns i1=0; i1<GARY_SIZE(e->n1->edges); i1++)
- {
- struct graph_edge *other = e->n1->edges[i1];
- if (other->visited) { dbg_bfs_continues++; continue; }
-
- if (((other->n1->id == e->n1->id) || (other->n2->id == e->n1->id)) &&
- (e->text) && (other->text) && (e->text->text == other->text->text))
- {
-// printf("Hit\n");
- other->visited = 1;
- }
- }
- for (uns i2=0; i2<GARY_SIZE(e->n2->edges); i2++)
- {
- struct graph_edge *other = e->n2->edges[i2];
- if (other->visited) {dbg_bfs_continues++; continue; }
-
- if (((other->n1->id == e->n2->id) || (other->n2->id == e->n2->id)) &&
- (e->text) && (other->text) && (e->text->text == other->text->text))
- {
-// printf("Hit\n");
- other->visited = 1;
- }
- }
- }
- }
-
- HASH_END_FOR;
- printf("Total: %d hits, %d visited edges skipped\n", dbg_num_hits, dbg_bfs_continues);
-
- GARY_FREE(bfs_queue);
-}
+/***
+* void oldbfs(void)
+* {
+* printf("Starting outer BFS\n");
+* printf("There are %u buffered lines and %d eges\n", GARY_SIZE(buffer_line), num_edges_dbg);
+*
+* GARY_INIT(bfs_queue, 0);
+* GARY_INIT(longlines, 0);
+*
+* int dbg_bfs_continues = 0;
+*
+* HASH_FOR_ALL(hash, node)
+* {
+* // FIXME: Skip if visited node
+*
+* for (uns i=0; i<GARY_SIZE(node->edges); i++)
+* {
+* struct graph_edge *e = node->edges[i];
+*
+* if (e->visited) continue;
+*
+* // BFS itself
+* for (uns i1=0; i1<GARY_SIZE(e->n1->edges); i1++)
+* {
+* struct graph_edge *other = e->n1->edges[i1];
+* if (other->visited) { dbg_bfs_continues++; continue; }
+*
+* if (((other->n1->id == e->n1->id) || (other->n2->id == e->n1->id)) &&
+* (e->text) && (other->text) && (e->text->text == other->text->text))
+* {
+* // printf("Hit\n");
+* other->visited = 1;
+* }
+* }
+* for (uns i2=0; i2<GARY_SIZE(e->n2->edges); i2++)
+* {
+* struct graph_edge *other = e->n2->edges[i2];
+* if (other->visited) {dbg_bfs_continues++; continue; }
+*
+* if (((other->n1->id == e->n2->id) || (other->n2->id == e->n2->id)) &&
+* (e->text) && (other->text) && (e->text->text == other->text->text))
+* {
+* // printf("Hit\n");
+* other->visited = 1;
+* }
+* }
+* }
+* }
+*
+* HASH_END_FOR;
+* printf("Total: %d hits, %d visited edges skipped\n", dbg_num_hits, dbg_bfs_continues);
+*
+* GARY_FREE(bfs_queue);
+* }
+* ***/