rangi.h

   1 #define NTHREADS        64
   2 /* for the input graph */
   3 #define NNODES          1000
   4 #define NSOLS           10000
   5 #define NCOLORS         512
   6 #define NLEN            64
   7 /* for the vertex-color bipartite graph */
   8 #define MPARTS          NCOLORS                 /* nodes in each partition */
   9 #define MNODES          (MPARTS * 2 + 2)        /* total nodes */
  10
  11 int matching(int **adj, int n1, int n2);
  12 void proc_init(int beg, int end, int inc, int one, int doheur);
  13 void found(int *nodes);
  14 int ownroot(int nsub, int idx);
  15 int motifs(int *subs[], int size);
  16 int nsub_next(int last);
  17 int nsub_finished(int nsub);
  18 void nsub_detected(int last);