1 /* gutils.h - procedure declarations for gutil1.c and gutil2.c */ 2 3 #ifdef __cplusplus 4 extern "C" { 5 #endif 6 7 extern void degstats(graph*,int,int, 8 unsigned long*,int*,int*,int*,int*,boolean*); 9 extern void degstats2(graph*,boolean,int,int,unsigned long*,int*l, 10 int*,int*,int*,int*, int*, int*,int*,int*, boolean*); 11 extern void degstats3(graph*,int,int, 12 unsigned long*,int*,int*,int*,int*,int*); 13 extern void diamstats(graph*,int,int,int*,int*); 14 extern void find_dist(graph*,int,int,int,int*); 15 extern void find_dist2(graph*,int,int,int,int,int*); 16 extern int girth(graph*,int,int); 17 extern boolean isbiconnected1(graph*,int); 18 extern boolean isbiconnected(graph*,int,int); 19 extern boolean isbipartite(graph*,int,int); 20 extern int bipartiteside(graph*,int,int); 21 extern boolean twocolouring(graph*,int*,int,int); 22 extern boolean isconnected1(graph*,int); 23 extern boolean isconnected(graph*,int,int); 24 extern boolean issubconnected(graph*,set*,int,int); 25 extern long maxcliques(graph*,int,int); 26 extern int maxcliquesize(graph*,int,int); 27 extern int maxindsetsize(graph*,int,int); 28 29 extern int loopcount(graph*,int,int); 30 extern long pathcount1(graph*,int,setword,setword); 31 extern long cyclecount1(graph*,int); 32 extern long cyclecount(graph*,int,int); 33 extern long indpathcount1(graph*,int,setword,setword); 34 extern long indcyclecount1(graph*,int); 35 extern long indcyclecount(graph*,int,int); 36 extern void commonnbrs(graph*,int*,int*,int*,int*,int,int); 37 extern void contract1(graph*,graph*,int,int,int); 38 extern int cstarcontent(graph*,int,int); 39 extern long numtriangles1(graph*,int); 40 extern long numtriangles(graph*,int,int); 41 extern long numdirtriangles(graph*,int,int); 42 extern void delete1(graph*,graph*,int,int); 43 extern int conncontent(graph*,int,int); 44 extern boolean stronglyconnected(graph*,int,int); 45 46 /* extern int diameter_sg(sparsegraph*,int*,int*); */ 47 48 #ifdef __cplusplus 49 } 50 #endif 51