7c219dd6db
- add fudge mode which gives a slightly slower hash function, but works almost always in the first iteration by avoiding degenerate edges - avoid keeping incidence lists around reducing the memory foot print by 30% - split edge processing from hashing as in the non-fudge case it is a reasonable costly part that often gets thrown away - merge graph2 and graph3 routines now that they are mostly the same
5 lines
55 B
C
5 lines
55 B
C
/* $NetBSD*/
|
|
|
|
#define GRAPH_SIZE 3
|
|
#include "graph2.c"
|