1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277
|
/* complg.c version 2.0; B D McKay, Jun 2015. */
#define USAGE "complg [-lq] [-a] [-L] [-r|-R] [infile [outfile]]"
#define HELPTEXT \
" Take the complements of a file of graphs.\n\
\n\
The output file has a header if and only if the input file does.\n\
The output format is defined by the header or first graph.\n\
\n\
-r Only complement if the complement has fewer directed edges.\n\
-R Only complement if the complement has fewer directed edges\n\
or has the same number of directed edges and is canonically\n\
less than the original.\n\
-a Also output the input graph (before the complement).\n\
-L Complement the loops too. By default, preserve them.\n\
-l Canonically label outputs.\n\
-q Suppress auxiliary information.\n"
/*************************************************************************/
#include "gtools.h"
/**************************************************************************/
static void
compl(graph *g, int m, int n, graph *h, boolean comploops)
/* h := complement of g */
{
int i,j;
setword *gi,*hi;
#if MAXN
set all[MAXM];
#else
DYNALLSTAT(set,all,all_sz);
DYNALLOC1(set,all,all_sz,m,"complg");
#endif
EMPTYSET(all,m);
for (i = 0; i < n; ++i) ADDELEMENT(all,i);
gi = (setword*) g;
hi = (setword*) h;
for (i = 0; i < n; ++i)
{
for (j = 0; j < m; ++j) hi[j] = gi[j] ^ all[j];
if (!comploops) FLIPELEMENT(hi,i);
gi += m;
hi += m;
}
}
/**************************************************************************/
int
main(int argc, char *argv[])
{
char *infilename,*outfilename;
FILE *infile,*outfile;
boolean also,dolabel,badargs,restricted,Restricted,quiet;
boolean digraph,Lswitch;
int j,m,n,argnum;
int codetype,outcode;
graph *g;
size_t ii,ned,nedc,nn,loops,loopsc,gwords;
nauty_counter nin;
char *arg,sw;
static graph *gq;
double t;
#if MAXN
graph gc[MAXN*MAXM],h[MAXN*MAXM],hc[MAXN*MAXM];
#else
DYNALLSTAT(graph,gc,gc_sz);
DYNALLSTAT(graph,h,h_sz);
DYNALLSTAT(graph,hc,hc_sz);
#endif
HELP; PUTVERSION;
infilename = outfilename = NULL;
dolabel = badargs = also = FALSE;
restricted = Restricted = quiet = Lswitch = FALSE;
argnum = 0;
badargs = FALSE;
for (j = 1; !badargs && j < argc; ++j)
{
arg = argv[j];
if (arg[0] == '-' && arg[1] != '\0')
{
++arg;
while (*arg != '\0')
{
sw = *arg++;
SWBOOLEAN('r',restricted)
else SWBOOLEAN('R',Restricted)
else SWBOOLEAN('l',dolabel)
else SWBOOLEAN('L',Lswitch)
else SWBOOLEAN('a',also)
else SWBOOLEAN('q',quiet)
else badargs = TRUE;
}
}
else
{
++argnum;
if (argnum == 1) infilename = arg;
else if (argnum == 2) outfilename = arg;
else badargs = TRUE;
}
}
if (badargs)
{
fprintf(stderr,">E Usage: %s\n",USAGE);
GETHELP;
exit(1);
}
if (!quiet)
{
fprintf(stderr,">A complg");
if (restricted || Restricted || dolabel || Lswitch || also)
fprintf(stderr," -");
if (restricted && !Restricted) fprintf(stderr,"r");
if (Restricted) fprintf(stderr,"R");
if (dolabel) fprintf(stderr,"l");
if (Lswitch) fprintf(stderr,"L");
if (also) fprintf(stderr,"a");
if (argnum > 0) fprintf(stderr," %s",infilename);
if (argnum > 1) fprintf(stderr," %s",outfilename);
fprintf(stderr,"\n");
fflush(stderr);
}
if (infilename && infilename[0] == '-') infilename = NULL;
infile = opengraphfile(infilename,&codetype,FALSE,1);
if (!infile) exit(1);
if (!infilename) infilename = "stdin";
if (!outfilename || outfilename[0] == '-')
{
outfilename = "stdout";
outfile = stdout;
}
else if ((outfile = fopen(outfilename,"w")) == NULL)
{
fprintf(stderr,"Can't open output file %s\n",outfilename);
gt_abort(NULL);
}
if (codetype&SPARSE6) outcode = SPARSE6;
else if (codetype&DIGRAPH6) outcode = DIGRAPH6;
else outcode = GRAPH6;
if (codetype&HAS_HEADER)
{
if (outcode == SPARSE6) writeline(outfile,SPARSE6_HEADER);
else if (outcode == DIGRAPH6) writeline(outfile,DIGRAPH6_HEADER);
else writeline(outfile,GRAPH6_HEADER);
}
nauty_check(WORDSIZE,1,1,NAUTYVERSIONID);
nin = 0;
t = CPUTIME;
while (TRUE)
{
if ((g = readgg(infile,NULL,0,&m,&n,&digraph)) == NULL) break;
++nin;
#if !MAXN
DYNALLOC2(graph,gc,gc_sz,n,m,"complg");
#endif
if (restricted || Restricted)
{
ned = loops = 0;
gwords = m * (size_t)n;
nn = n * (size_t)(n-1);
for (ii = 0; ii < gwords; ++ii) ned += POPCOUNT(g[ii]);
for (ii = 0; ii < n; ++ii) if (ISELEMENT(g+m*ii,ii)) ++loops;
if (Lswitch)
{
loopsc = n - loops;
nedc = nn + n - (ned-loops)/2;
}
else
{
loopsc = loops;
nedc = nn - (ned-3*loops)/2;
}
if (ned > nedc || (ned == nedc && !Restricted))
{
compl(g,m,n,gc,Lswitch);
if (dolabel)
{
#if !MAXN
DYNALLOC2(graph,hc,hc_sz,n,m,"complg");
#endif
fcanonise(gc,m,n,hc,NULL,digraph||loopsc>0);
gq = hc;
}
else
gq = gc;
}
else if (ned < nedc)
{
if (dolabel)
{
#if !MAXN
DYNALLOC2(graph,h,h_sz,n,m,"complg");
#endif
fcanonise(g,m,n,h,NULL,digraph||loops>0);
gq = h;
}
else
gq = g;
}
else
{
compl(g,m,n,gc,Lswitch);
#if !MAXN
DYNALLOC2(graph,h,h_sz,n,m,"complg");
DYNALLOC2(graph,hc,hc_sz,n,m,"complg");
#endif
fcanonise(g,m,n,h,NULL,digraph||loops>0);
fcanonise(gc,m,n,hc,NULL,digraph||loopsc>0);
for (ii = 0; ii < gwords; ++ii)
if (h[ii] != hc[ii]) break;
if (ii == gwords || hc[ii] < h[ii])
{
if (dolabel) gq = hc; else gq = gc;
}
else
{
if (dolabel) gq = h; else gq = g;
}
}
}
else /* Not restricted */
{
compl(g,m,n,gc,Lswitch);
if (dolabel)
{
#if !MAXN
DYNALLOC2(graph,hc,hc_sz,n,m,"complg");
#endif
fcanonise(gc,m,n,hc,NULL,digraph||loopsc>0);
gq = hc;
}
else
gq = gc;
}
if (also)
{
if (outcode == SPARSE6) writes6(outfile,g,m,n);
else if (outcode == DIGRAPH6) writed6(outfile,g,m,n);
else writeg6(outfile,g,m,n);
}
if (outcode == SPARSE6) writes6(outfile,gq,m,n);
else if (outcode == DIGRAPH6) writed6(outfile,gq,m,n);
else writeg6(outfile,gq,m,n);
FREES(g);
}
t = CPUTIME - t;
if (!quiet)
fprintf(stderr,">Z " COUNTER_FMT
" graphs converted from %s to %s in %3.2f sec.\n",
nin,infilename,outfilename,t);
exit(0);
}
|