debian/0000755000000000000000000000000011733230411007161 5ustar debian/multig.10000644000000000000000000000336511733230105010553 0ustar .TH MULTIG "1" "May 2009" "nauty 2.4" "User Commands" .SH NAME multig \- Read undirected loop\-free graphs and replace their edges with multiple .SH SYNOPSIS .B multig [\fI\-q\fR] [\fI\-u|\-T|\-G|\-A|\-B\fR] [\fI\-e#|\-e#:#\fR] [\fI\-m#\fR] [\fI\-f#\fR] [\fI\-D#|\-r#|\-l#\fR] [\fIinfile \fR[\fIoutfile\fR]] .SH DESCRIPTION .IP Read undirected loop\-free graphs and replace their edges with multiple .IP edges in all possible ways (multiplicity at least 1). Isomorphic multigraphs derived from the same input are suppressed. If the input graphs are non\-isomorphic then the output graphs are also. .TP \fB\-e\fR# | \fB\-e\fR#:# specify a value or range of the total number of edges counting multiplicities .HP \fB\-m\fR# maximum edge multiplicity (minimum is 1) .HP \fB\-D\fR# upper bound on maximum degree .HP \fB\-r\fR# make regular of specified degree (incompatible with \fB\-l\fR, \fB\-D\fR, \fB\-e\fR) .HP \fB\-l\fR# make regular multigraphs with multiloops, degree # .IP (incompatible with \fB\-r\fR, \fB\-D\fR, \fB\-e\fR) .IP Either \fB\-l\fR, \fB\-r\fR, \fB\-D\fR, \fB\-e\fR or \fB\-m\fR with a finite maximum must be given \fB\-f\fR# Use the group that fixes the first # vertices setwise \fB\-T\fR use a simple text output format (nv ne {v1 v2 mult}) \fB\-G\fR like \fB\-T\fR but includes group size as third item (if less than 10^10) .IP The group size does not include exchange of isolated vertices. .TP \fB\-A\fR write as the upper triangle of an adjacency matrix, row by row, including the diagonal, and preceded by the number of vertices .TP \fB\-B\fR write as an integer matrix preceded by the number of rows and number of columns, where \fB\-f\fR determines the number of rows .TP \fB\-u\fR no output, just count them .TP \fB\-q\fR suppress auxiliary information debian/complg.10000644000000000000000000000072211733230105010525 0ustar .TH COMPLG "1" "May 2009" "nauty 2.4" "User Commands" .SH NAME complg \- Take the complements of a file of graphs. .SH SYNOPSIS .B complg [\fI\-lrq\fR] [\fIinfile \fR[\fIoutfile\fR]] .SH DESCRIPTION .IP Take the complements of a file of graphs. .IP The output file has a header if and only if the input file does. .TP \fB\-r\fR Only complement if the complement has fewer edges. .TP \fB\-l\fR Canonically label outputs. .TP \fB\-q\fR Suppress auxiliary information. debian/newedgeg.10000644000000000000000000000077311733230105011037 0ustar .TH NEWEDGEG "1" "May 2009" "nauty 2.4" "User Commands" .SH NAME newedgeg \- For each pair of non\-adjacent edges, output the graph obtained .SH SYNOPSIS .B newedgeg [\fI\-lq\fR] [\fIinfile \fR[\fIoutfile\fR]] .SH DESCRIPTION .IP For each pair of non\-adjacent edges, output the graph obtained .IP by subdividing the edges and joining the new vertices. .IP The output file has a header if and only if the input file does. .TP \fB\-l\fR Canonically label outputs .TP \fB\-q\fR Suppress auxiliary information debian/pickg.10000644000000000000000000000452311733230105010344 0ustar .TH PICKG "1" "May 2009" "nauty 2.4" "User Commands" .SH NAME pickg \- countg : Count graphs according to their properties. .SH SYNOPSIS .B [pickg|countg] [\fI\-fp#:#q \-V\fR] [\fI\--keys\fR] [\fI\-constraints \-v\fR] [\fIifile \fR[\fIofile\fR]] .SH DESCRIPTION .IP countg : Count graphs according to their properties. .IP pickg : Select graphs according to their properties. .IP ifile, ofile : Input and output files. .IP \&'\-' and missing names imply stdin and stdout. .IP Miscellaneous switches: .TP \fB\-p\fR# \fB\-p\fR#:# Specify range of input lines (first is 1) .TP \fB\-f\fR With \fB\-p\fR, assume input lines of fixed length (only used with a file in graph6 format) .TP \fB\-v\fR Negate all constraints .TP \fB\-V\fR List properties of every input matching constraints. .TP \fB\-q\fR Suppress informative output. .IP Constraints: .IP Numerical constraints (shown here with following #) can take a single integer value, or a range like #:#, #:, or :#. Each can also be preceded by '~', which negates it. (For example, \-~D2:4 will match any maximum degree which is _not_ 2, 3, or 4.) Constraints are applied to all input graphs, and only those which match all constraints are counted or selected. .TP \fB\-n\fR# number of vertices \fB\-e\fR# number of edges .TP \fB\-d\fR# minimum degree \fB\-D\fR# maximum degree .TP \fB\-r\fR regular \fB\-b\fR bipartite .TP \fB\-z\fR# radius \fB\-Z\fR# diameter .TP \fB\-g\fR# girth (0=acyclic) \fB\-Y\fR# total number of cycles .TP \fB\-T\fR# number of triangles .TP \fB\-E\fR Eulerian (all degrees are even, connectivity not required) .TP \fB\-a\fR# group size \fB\-o\fR# orbits \fB\-F\fR# fixed points \fB\-t\fR vertex\-transitive .TP \fB\-c\fR# connectivity (only implemented for 0,1,2). .TP \fB\-i\fR# min common nbrs of adjacent vertices; \fB\-I\fR# maximum .TP \fB\-j\fR# min common nbrs of non\-adjacent vertices; \fB\-J\fR# maximum .IP Sort keys: .TP Counts are made for all graphs passing the constraints. Counts .IP are given separately for each combination of values occurring for the properties listed as sort keys. A sort key is introduced by \&'\-\-' and uses one of the letters known as constraints. These can be combined: \fB\-\-n\fR \fB\-\-e\fR \fB\-\-r\fR is the same as \fB\-\-ne\fR \fB\-\-r\fR and \fB\-\-ner\fR. The order of sort keys is significant. debian/libnauty-dev.install0000644000000000000000000000013211733230105013150 0ustar usr/include/nauty.h /usr/include usr/lib/libnauty.a /usr/lib usr/lib/libnauty.so /usr/lib debian/genbg.10000644000000000000000000000357311733230105010335 0ustar .TH GENBG "1" "May 2009" "nauty 2.4" "User Commands" .SH NAME genbg \- [mine[:maxe]] [res/mod] [file] .SH SYNOPSIS .B genbg [\fI\-c \-ugsn \-vq \-lzF\fR] [\fI\-Z#\fR] [\fI\-d#|\-d#:#\fR] [\fI\-D#|\-D#:#\fR] \fIn1 n2\fR .SH DESCRIPTION .IP [mine[:maxe]] [res/mod] [file] .IP Find all bicoloured graphs of a specified class. .TP n1 : the number of vertices in the first class .TP n2 : the number of vertices in the second class .IP mine:maxe : a range for the number of edges .IP #:0 means '# or more' except in the case 0:0 .IP res/mod : only generate subset res out of subsets 0..mod\-1 .IP file : the name of the output file (default stdout) .TP \fB\-c\fR : only write connected graphs .TP \fB\-z\fR : all the vertices in the second class must have .IP different neighbourhoods .TP \fB\-F\fR : the vertices in the second class must have at least two .IP neighbours of degree at least 2 .TP \fB\-L\fR : there is no vertex in the first class whose removal leaves .IP the vertices in the second class unreachable from each other .TP \fB\-Z\fR# : two vertices in the second class may have at most # common nbrs .TP \fB\-D\fR# : specify an upper bound for the maximum degree. .TP Example: \fB\-D6\fR. You can also give separate maxima for the .IP two parts, for example: \fB\-D5\fR:6 .TP \fB\-d\fR# : specify a lower bound for the minimum degree. .IP Again, you can specify it separately for the two parts: \fB\-d1\fR:2 .TP \fB\-n\fR : use nauty format for output .TP \fB\-g\fR : use graph6 format for output (default) .TP \fB\-s\fR : use sparse6 format for output .TP \fB\-a\fR : use Greechie diagram format for output .TP \fB\-u\fR : do not output any graphs, just generate and count them .TP \fB\-v\fR : display counts by number of edges to stderr .TP \fB\-l\fR : canonically label output graphs (using the 2\-part colouring) .TP \fB\-q\fR : suppress auxiliary output .IP See program text for much more information. debian/dretog.10000644000000000000000000000174611733230105010537 0ustar .TH DRETOG "1" "May 2009" "nauty 2.4" "User Commands" .SH NAME dretog \- Read graphs in dreadnaut format. .SH SYNOPSIS .B dretog [\fI\-n#o#sghq\fR] [\fIinfile \fR[\fIoutfile\fR]] .SH DESCRIPTION .IP Read graphs in dreadnaut format. .TP \fB\-o\fR# Label vertices starting at # (default 0). This can be overridden in the input. .TP \fB\-n\fR# Set the initial graph order to # (no default). This can be overridden in the input. .TP \fB\-g\fR Use graph6 format (default). .TP \fB\-s\fR Use sparse6 format. .TP \fB\-h\fR Write a header (according to \fB\-g\fR or \fB\-s\fR). .IP Input consists of a sequence of dreadnaut commands restricted to: .TP n=# set number of vertices (no default) The = is optional. .TP $=# set label of first vertex (default 0) The = is optional. .TP $$ return origin to initial value (see \fB\-o\fR#) .TP ".." and !..\en comments to ignore .TP g specify graph to follow (as dreadnaut format) Can be omitted if first character of graph is a digit or ';'. .TP q exit (optional) debian/listg.10000644000000000000000000000303211733230105010363 0ustar .TH LISTG "1" "May 2009" "nauty 2.4" "User Commands" .SH NAME listg \- Write graphs in human\-readable format. .SH SYNOPSIS .B listg [\fI\-fp#:#l#o#Ftq\fR] [\fI\-a|\-A|\-c|\-d|\-e|\-M|\-s\fR] [\fIinfile \fR[\fIoutfile\fR]] .SH DESCRIPTION .IP Write graphs in human\-readable format. .TP \fB\-f\fR : assume inputs have same size (only used from a file .IP and only if \fB\-p\fR is given) .HP \fB\-p\fR#, \fB\-p\fR#:#, \fB\-p\fR#\-# : only display one graph or a sequence of .TP graphs. The first graph is number 1. A second number .IP which is empty or zero means infinity. .TP \fB\-a\fR : write as adjacency matrix, not as list of adjacencies .TP \fB\-A\fR : same as \fB\-a\fR with a space between entries .HP \fB\-l\fR# : specify screen width limit (default 78, 0 means no limit) .IP This is not currently implemented with \fB\-a\fR or \fB\-A\fR. .HP \fB\-o\fR# : specify number of first vertex (default is 0). .TP \fB\-d\fR : write output to satisfy dreadnaut .TP \fB\-c\fR : write ascii form with minimal line\-breaks .TP \fB\-e\fR : write a list of edges, preceded by the order and the .IP number of edges .TP \fB\-M\fR : write in Magma format .TP \fB\-W\fR : write matrix in Maple format .TP \fB\-t\fR : write upper triangle only (affects \fB\-a\fR, \fB\-A\fR, \fB\-d\fR and default) .TP \fB\-s\fR : write only the numbers of vertices and edges .TP \fB\-F\fR : write a form\-feed after each graph except the last .TP \fB\-q\fR : suppress auxiliary output .HP \fB\-a\fR, \fB\-A\fR, \fB\-c\fR, \fB\-d\fR, \fB\-M\fR, \fB\-W\fR and \fB\-e\fR are incompatible. debian/rules0000755000000000000000000000107111733230105010240 0ustar #!/usr/bin/make -f # -*- makefile -*- # Uncomment this to turn on verbose mode. #export DH_VERBOSE=1 # use wildcard to avoid warning from dh include $(wildcard /usr/share/topgit/tg2quilt.mk) SONAME=libnauty.so.1d %: dh $@ override_dh_auto_build: $(MAKE) SHARED=yes SONAME=$(SONAME) override_dh_auto_clean: $(MAKE) -f makefile.basic clean override_dh_auto_install: $(MAKE) SHARED=yes SONAME=$(SONAME) DESTDIR=$(CURDIR)/debian/tmp install install-dev install-shlibs override_dh_auto_test: ifeq (,$(findstring nocheck,$(DEB_BUILD_OPTIONS))) make checks endif debian/shortg.10000644000000000000000000000560211733230105010554 0ustar .TH SHORTG "1" "May 2009" "nauty 2.4" "User Commands" .SH NAME shortg \- Remove isomorphs from a file of graphs. .SH SYNOPSIS .B shortg [\fI\-qvkdu\fR] [\fI\-i# \-I#:# \-K#\fR] [\fI\-fxxx\fR] [\fI\-Tdir\fR] [\fIinfile \fR[\fIoutfile\fR]] .SH DESCRIPTION .IP Remove isomorphs from a file of graphs. .IP If outfile is omitted, it is taken to be the same as infile If both infile and outfile are omitted, input will be taken .IP from stdin and written to stdout .IP The output file has a header if and only if the input file does. .TP \fB\-s\fR force output to sparse6 format .TP \fB\-g\fR force output to graph6 format If neither \fB\-s\fR or \fB\-g\fR are given, the output format is determined by the header or, if there is none, by the format of the first input graph. .TP \fB\-k\fR output graphs have the same labelling and format as the inputs. Otherwise, output graphs have canonical labelling. \fB\-s\fR and \fB\-g\fR are ineffective if \fB\-k\fR is given. If none of \fB\-sgk\fR are given, the output format is determined by the header or, if there is none, by the format of the first input graph. .TP \fB\-v\fR write to stderr a list of which input graphs correspond to which output graphs. The input and output graphs are both numbered beginning at 1. A line like .IP 23 : 30 154 78 .IP means that inputs 30, 154 and 78 were isomorphic, and produced output 23. .TP \fB\-d\fR include in the output only those inputs which are isomorphic to another input. If \fB\-k\fR is specified, all such inputs are included in their original labelling. Without \fB\-k\fR, only one member of each nontrivial isomorphism class is written, with canonical labelling. .TP \fB\-fxxx\fR Specify a partition of the point set. xxx is any .TP string of ASCII characters except nul. This string is .IP considered extended to infinity on the right with the character 'z'. One character is associated with each point, in the order given. The labelling used obeys these rules: .IP (1) the new order of the points is such that the associated .IP characters are in ASCII ascending order .IP (2) if two graphs are labelled using the same string xxx, .IP the output graphs are identical iff there is an associated\-character\-preserving isomorphism between them. .TP \fB\-i\fR# select an invariant (1 = twopaths, 2 = adjtriang(K), 3 = triples, .IP 4 = quadruples, 5 = celltrips, 6 = cellquads, 7 = cellquins, 8 = distances(K), 9 = indsets(K), 10 = cliques(K), 11 = cellcliq(K), .IP 12 = cellind(K), 13 = adjacencies, 14 = cellfano, 15 = cellfano2) .TP \fB\-I\fR#:# select mininvarlevel and maxinvarlevel (default 1:1) .TP \fB\-K\fR# select invararg (default 3) .TP \fB\-u\fR Write no output, just report how many graphs it would have output. In this case, outfile is not permitted. .TP \fB\-Tdir\fR Specify that directory "dir" will be used for temporary disk .TP space by the sort subprocess. The default is usually /tmp. .TP \fB\-q\fR Suppress auxiliary output debian/patches/0000755000000000000000000000000011733230116010612 5ustar debian/patches/series0000644000000000000000000000021711733230116012027 0ustar # debian/source/git-patches exported from git by quilt-patches-deb-export-hook 0001-makefile.in-Support-building-a-shared-library-and-st.patch debian/patches/0001-makefile.in-Support-building-a-shared-library-and-st.patch0000644000000000000000000003407711733230116024163 0ustar From 0a773beb744aa78edc92ad2b8ddf6f90b9b5d544 Mon Sep 17 00:00:00 2001 From: David Bremner Date: Tue, 13 Mar 2012 08:31:49 -0300 Subject: [PATCH] makefile.in: Support building a shared library and static library. This has been sent upstream but seems unlikely to be adopted. Signed-off-by: David Bremner --- makefile.in | 241 +++++++++++++++++++++++++++++++++-------------------------- 1 files changed, 136 insertions(+), 105 deletions(-) diff --git a/makefile.in b/makefile.in index b8b8bd9..135c675 100644 --- a/makefile.in +++ b/makefile.in @@ -18,35 +18,94 @@ S1=-DMAXN=WORDSIZE -DWORDSIZE=16 S=-DWORDSIZE=16 L=-DWORDSIZE=64 FOURK=-DMAXN=4096 +PICFLAGS=-fPIC +TESTCFLAGS=-static + +NAUTYLIBOBJ= naututil.o nauty.o nautil.o nautinv.o naugraph.o rng.o +GTLIBOBJ=gtools.o gtnauty.o nausparse.o gutil1.o gutil2.o naugroup.o +LIBOBJ=${NAUTYLIBOBJ} ${GTLIBOBJ} + +SHNAUTYLIBOBJ= naututil.os nauty.os nautil.os nautinv.os naugraph.os rng.os +SHGTLIBOBJ=gtools.os gtnauty.os nausparse.os gutil1.os gutil2.os naugroup.os +SHLIBOBJ=${SHNAUTYLIBOBJ} ${SHGTLIBOBJ} + +STLIB=libnauty.a + +ifeq ($(SHARED),yes) +SONAME?=libnauty.so.0 +SOMINOR?=.0.0 +SHLIB?=$(SONAME)$(SOMINOR) +SHLINK?=libnauty.so +BUILDSHLIBS=$(SONAME) $(SHLIB) $(SHLINK) +LDFLAGS:=-L. -lnauty $(LDFLAGS) +else +BUILDSHLIBS= +endif + +DESTDIR= +GTOOLSBIN=copyg listg labelg dretog amtog geng complg shortg showg NRswitchg \ + biplabg addedgeg deledgeg countg pickg genrang newedgeg catg genbg directg \ + multig planarg gentourng +BINARIES=$(GTOOLSBIN) dreadnaut + +.SUFFIXES: .os +.c.os: + ${CC} -c ${PICFLAGS} ${CFLAGS} -o $@ $< + +%.o: %.c + ${CC} -c ${CFLAGS} -o $@ $< + +.PHONY: all nauty libs gtools install clean all : nauty gtools ; nauty : dreadnaut ; -gtools : copyg listg labelg dretog amtog geng complg shortg showg NRswitchg \ - biplabg addedgeg deledgeg countg pickg genrang newedgeg catg genbg directg \ - multig planarg gentourng ; +LIBS=$(STLIB) $(BUILDSHLIBS) +libs: $(LIBS) + +gtools: $(GTOOLSBIN) + +$(SHLIB): $(SHLIBOBJ) + gcc -shared -Wl,-soname=$(SONAME) -o $(SONAME)$(SOMINOR) $(SHLIBOBJ) + +$(SONAME): $(SHLIB) + rm -f $@ && ln -s $(SHLIB) $@ + +$(SHLINK): $(SONAME) + rm -f $@ && ln -s $(SONAME) $@ + +install-shlibs: $(SHLIB) + mkdir -p $(DESTDIR)/usr/lib + install -t $(DESTDIR)/usr/lib $(SHLIB) + cd $(DESTDIR)/usr/lib && ln -sf $(SONAME) $(SHLINK) && ln -sf $(SHLIB) $(SONAME) + +install: + mkdir -p $(DESTDIR)/usr/bin + install -t $(DESTDIR)/usr/bin $(BINARIES) + +install-dev: + mkdir -p $(DESTDIR)/usr/include + install -t $(DESTDIR)/usr/include nauty.h + mkdir -p $(DESTDIR)/usr/lib + install -t $(DESTDIR)/usr/lib $(STLIB) + +$(STLIB): $(LIBOBJ) + ar r $@ $(LIBOBJ) rng.o: rng.c ${CC} -c ${CFLAGS} rng.c -dreadnaut: dreadnaut.c naututil.o nauty.o nautil.o nautinv.o naugraph.o rng.o - ${CC} -o dreadnaut ${SAFECFLAGS} dreadnaut.c \ - naututil.o nauty.o nautil.o nautinv.o naugraph.o rng.o ${LDFLAGS} +dreadnaut: dreadnaut.c $(LIBS) + ${CC} -o dreadnaut ${SAFECFLAGS} dreadnaut.c ${LDFLAGS} + naututil.o: nauty.h naututil.h naututil.c - ${CC} -c ${CFLAGS} naututil.c nautil.o: nauty.h nautil.c - ${CC} -c ${CFLAGS} nautil.c nauty.o: nauty.h nauty.c - ${CC} -c ${CFLAGS} nauty.c nautinv.o: nauty.h naututil.h nautinv.c - ${CC} -c ${CFLAGS} nautinv.c nautaux.o: nautaux.h nauty.h naututil.h nautaux.c - ${CC} -c ${CFLAGS} nautaux.c naugraph.o: nauty.h naugraph.c - ${CC} -c ${CFLAGS} naugraph.c nausparse.o : nauty.h nausparse.h nausparse.c - ${CC} -c ${CFLAGS} nausparse.c dreadnaut1: dreadnaut.c naututil1.o nauty1.o nautil1.o \ nautinv1.o naugraph1.o rng.o @@ -176,6 +235,7 @@ clean: dreadtestS${EXEEXT} dreadtestS1${EXEEXT} \ dreadtest4K${EXEEXT} dreadtest1${EXEEXT} \ dreadtestL1${EXEEXT} dreadtestW1${EXEEXT} + rm -f libnauty.* *.os gtools.h : nauty.h naututil.h nausparse.h touch gtools.h @@ -192,33 +252,26 @@ gutil1.o : gtools.h gutils.h gutil1.c gutil2.o : gtools.h gutils.h gutil2.c ${CC} -c ${CFLAGS} gutil2.c -catg : gtools.h catg.c gtools.o - ${CC} -o catg ${CFLAGS} catg.c gtools.o ${LDFLAGS} +catg : gtools.h catg.c $(LIBS) + ${CC} -o catg ${CFLAGS} catg.c ${LDFLAGS} -copyg : gtools.h copyg.c gtools.o - ${CC} -o copyg ${CFLAGS} copyg.c gtools.o ${LDFLAGS} +copyg : gtools.h copyg.c $(LIBS) + ${CC} -o copyg ${CFLAGS} copyg.c ${LDFLAGS} -listg : gtools.h listg.c gtools.o nautil.o - ${CC} -o listg ${CFLAGS} listg.c gtools.o nautil.o ${LDFLAGS} +listg : gtools.h listg.c $(LIBS) + ${CC} -o listg ${CFLAGS} listg.c ${LDFLAGS} -labelg : gtools.h naututil.h labelg.c gtools.o gtnauty.o nauty.o \ - nautil.o naugraph.o nautinv.o nausparse.h nausparse.o \ - gutils.h gutil2.o - ${CC} -o labelg ${SAFECFLAGS} labelg.c gtools.o gtnauty.o \ - nauty.o nautil.o naugraph.o nautinv.o nausparse.o \ - gutil2.o ${LDFLAGS} +labelg : gtools.h naututil.h labelg.c $(LIBS) + ${CC} -o labelg ${SAFECFLAGS} labelg.c ${LDFLAGS} -shortg : gtools.h shortg.c gtools.o gtnauty.o nauty.o nautil.o naugraph.o \ - nausparse.h nausparse.o gutils.h gutil2.o nautinv.h nautinv.o - ${CC} -o shortg ${CFLAGS} shortg.c gtools.o gtnauty.o nautinv.o \ - nauty.o nautil.o naugraph.o nausparse.o gutil2.o ${LDFLAGS} +shortg : gtools.h shortg.c $(LIBS) + ${CC} -o shortg ${CFLAGS} shortg.c ${LDFLAGS} -dretog : gtools.h dretog.c gtools.o naututil.o nautil.o naugraph.o rng.o - ${CC} -o dretog ${CFLAGS} dretog.c \ - gtools.o naututil.o nautil.o rng.o naugraph.o ${LDFLAGS} +dretog : gtools.h dretog.c $(LIBS) + ${CC} -o dretog ${CFLAGS} dretog.c ${LDFLAGS} -amtog : gtools.h amtog.c gtools.o - ${CC} -o amtog ${CFLAGS} amtog.c gtools.o ${LDFLAGS} +amtog : gtools.h amtog.c $(LIBS) + ${CC} -o amtog ${CFLAGS} amtog.c ${LDFLAGS} genbg : gtools.h genbg.c gtoolsW1.o nautyW1.o nautilW1.o naugraphW1.o ${CC} -o genbg ${CFLAGS} ${W1} genbg.c gtoolsW1.o \ @@ -228,79 +281,57 @@ genbgL : gtools.h genbg.c gtoolsL1.o nautyL1.o nautilL1.o naugraphL1.o ${CC} -o genbgL ${CFLAGS} ${L1} -DMAXN1=30 genbg.c gtoolsL1.o \ nautyL1.o nautilL1.o naugraphL1.o ${LDFLAGS} -geng : gtools.h geng.c gtools.o nauty1.o nautil1.o naugraph1.o - ${CC} -o geng ${CFLAGS} -DMAXN=32 geng.c gtools.o nauty1.o \ +geng : gtools.h geng.c nauty1.o nautil1.o naugraph1.o + ${CC} -o geng ${CFLAGS} -DMAXN=32 geng.c nauty1.o \ nautil1.o naugraph1.o ${LDFLAGS} -geng16 : gtools.h geng.c gtools.o nauty1.o nautil1.o naugraph1.o - ${CC} -o geng16 ${CFLAGS} -DMAXN=16 geng.c gtools.o nauty1.o \ +geng16 : gtools.h geng.c nauty1.o nautil1.o naugraph1.o + ${CC} -o geng16 ${CFLAGS} -DMAXN=16 geng.c nauty1.o \ nautil1.o naugraph1.o ${LDFLAGS} -geng24 : gtools.h geng.c gtools.o nauty1.o nautil1.o naugraph1.o - ${CC} -o geng24 ${CFLAGS} -DMAXN=24 geng.c gtools.o nauty1.o \ +geng24 : gtools.h geng.c nauty1.o nautil1.o naugraph1.o + ${CC} -o geng24 ${CFLAGS} -DMAXN=24 geng.c nauty1.o \ nautil1.o naugraph1.o ${LDFLAGS} gentourng : gtools.h gentourng.c gtools.o nauty1.o nautil1.o naugraph1.o ${CC} -o gentourng ${CFLAGS} -DMAXN=24 gentourng.c gtools.o nauty1.o \ nautil1.o naugraph1.o ${LDFLAGS} -genrang : gtools.h genrang.c gtools.o naututil.o nautil.o naugraph.o \ - rng.o nausparse.o - ${CC} -o genrang ${CFLAGS} genrang.c nausparse.o \ - gtools.o nautil.o naututil.o naugraph.o rng.o ${LDFLAGS} - -complg : gtools.h complg.c gtools.o gtnauty.o nauty.o nautil.o \ - naugraph.o nausparse.o - ${CC} -o complg ${CFLAGS} complg.c gtools.o gtnauty.o \ - nauty.o nautil.o naugraph.o nausparse.o ${LDFLAGS} - -biplabg : gtools.h biplabg.c gtools.o nautil.o naugraph.o gutil1.o - ${CC} -o biplabg ${CFLAGS} biplabg.c \ - gtools.o nautil.o naugraph.o gutil1.o ${LDFLAGS} - -NRswitchg : gtools.h NRswitchg.c gtools.o gtnauty.o nauty.o nautil.o \ - nausparse.o naugraph.o - ${CC} -o NRswitchg ${CFLAGS} NRswitchg.c gtools.o gtnauty.o \ - nauty.o nautil.o naugraph.o nausparse.o ${LDFLAGS} - -deledgeg : gtools.h deledgeg.c gtools.o gtnauty.o nauty.o nautil.o \ - naugraph.o nausparse.o - ${CC} -o deledgeg ${CFLAGS} deledgeg.c gtools.o gtnauty.o \ - nauty.o nautil.o naugraph.o nausparse.o ${LDFLAGS} - -addedgeg : gtools.h addedgeg.c gtools.o gtnauty.o nauty.o nautil.o \ - naugraph.o gutil1.o nausparse.o - ${CC} -o addedgeg ${CFLAGS} addedgeg.c gtools.o gtnauty.o \ - nauty.o nautil.o naugraph.o gutil1.o nausparse.o ${LDFLAGS} - -newedgeg : gtools.h newedgeg.c nausparse.o \ - gtools.o gtnauty.o nauty.o nautil.o naugraph.o - ${CC} -o newedgeg ${CFLAGS} newedgeg.c gtools.o gtnauty.o \ - nauty.o nautil.o naugraph.o nausparse.o ${LDFLAGS} - -pickg : gtools.h testg.c splay.c nausparse.o \ - gtools.o gtnauty.o nauty.o nautil.o naugraph.o gutil1.o gutil2.o - ${CC} -o pickg ${SAFECFLAGS} testg.c gtools.o gtnauty.o gutil1.o \ - gutil2.o nauty.o nautil.o naugraph.o nausparse.o ${LDFLAGS} - -countg : gtools.h testg.c splay.c nausparse.o \ - gtools.o gtnauty.o nauty.o nautil.o naugraph.o gutil1.o gutil2.o - ${CC} -o countg ${SAFECFLAGS} testg.c gtools.o gtnauty.o gutil1.o \ - gutil2.o nauty.o nautil.o naugraph.o nausparse.o ${LDFLAGS} - -directg : gtools.h naugroup.h directg.c \ - gtools.o nauty.o nautil.o naugraph.o naugroup.o - ${CC} -o directg ${CFLAGS} directg.c gtools.o \ - nauty.o nautil.o naugraph.o naugroup.o ${LDFLAGS} - -multig : gtools.h naugroup.h multig.c \ - gtools.o nauty.o nautil.o naugraph.o naugroup.o - ${CC} -o multig ${CFLAGS} multig.c gtools.o \ - nauty.o nautil.o naugraph.o naugroup.o ${LDFLAGS} - -planarg : gtools.h planarg.c gtools.o planarity.c - ${CC} -o planarg ${CFLAGS} \ - planarg.c planarity.c gtools.o ${LDFLAGS} +genrang : gtools.h genrang.c $(LIBS) + ${CC} -o genrang ${CFLAGS} genrang.c ${LDFLAGS} + +complg : gtools.h complg.c + ${CC} -o complg ${CFLAGS} complg.c ${LDFLAGS} + +biplabg : gtools.h biplabg.c $(LIBS) + ${CC} -o biplabg ${CFLAGS} biplabg.c ${LDFLAGS} + +NRswitchg : gtools.h NRswitchg.c $(LIBS) + ${CC} -o NRswitchg ${CFLAGS} NRswitchg.c ${LDFLAGS} + +deledgeg : gtools.h deledgeg.c $(LIBS) + ${CC} -o deledgeg ${CFLAGS} deledgeg.c ${LDFLAGS} + +addedgeg : gtools.h addedgeg.c $(LIBS) + ${CC} -o addedgeg ${CFLAGS} addedgeg.c ${LDFLAGS} + +newedgeg : gtools.h newedgeg.c $(LIBS) + ${CC} -o newedgeg ${CFLAGS} newedgeg.c ${LDFLAGS} + +pickg : gtools.h testg.c splay.c $(LIBS) + ${CC} -o pickg ${SAFECFLAGS} testg.c ${LDFLAGS} + +countg : gtools.h testg.c splay.c $(LIBS) + ${CC} -o countg ${SAFECFLAGS} testg.c ${LDFLAGS} + +directg : gtools.h naugroup.h directg.c $(LIBS) + ${CC} -o directg ${CFLAGS} directg.c ${LDFLAGS} + +multig : gtools.h naugroup.h multig.c $(LIBS) + ${CC} -o multig ${CFLAGS} multig.c ${LDFLAGS} + +planarg : gtools.h planarg.c planarity.c $(LIBS) + ${CC} -o planarg ${CFLAGS} planarg.c planarity.c ${LDFLAGS} showg : showg.c ${CC} -o showg ${CFLAGS} showg.c ${LDFLAGS} @@ -344,7 +375,7 @@ nautyex5 : nauty.h nausparse.h nauty.o nautil.o \ nautyex5.c nauty.o nautil.o nausparse.o naugroup.o ${LDFLAGS} dreadtest: dreadtest.c naututil.o nauty.o nautil.o nautinv.o naugraph.o rng.o - ${CC} -o dreadtest ${SAFECFLAGS} dreadtest.c \ + ${CC} -o dreadtest ${TESTCFLAGS} ${SAFECFLAGS} dreadtest.c \ naututil.o nauty.o nautil.o nautinv.o naugraph.o rng.o ${LDFLAGS} ./dreadtest Fri, 23 Mar 2012 23:18:35 -0300 nauty (2.4-2) unstable; urgency=low * Fix depends of libnauty-dev to libnauty1d. Thanks to Jan Hauke Rahm for noticing. -- David Bremner Tue, 23 Feb 2010 06:44:50 -0400 nauty (2.4-1) unstable; urgency=low * New upstream version * Fix FTBFS (Closes: #569626), (LP: #521190). - Caused by getline becoming visible in stdio.h by default - Rename getline to gtools_getline - Bump soname because of changed ABI - Thanks to Kamal Mostafa , for the report and patch. * Update standards version to 3.8.4 (no changes) * Convert to source format 3.0 (quilt) -- David Bremner Sat, 13 Feb 2010 05:27:59 -0400 nauty (2.4~b7-2) unstable; urgency=low * Fix FTBFS (amd64, and probably elsewhere) of packages build-depending on libnauty-dev - add missing libnauty.so symlink to libnauty-dev (Closes: #546729) - add dependency on libnauty0d to libnauty-dev -- David Bremner Thu, 17 Sep 2009 08:40:45 -0300 nauty (2.4~b7-1) unstable; urgency=low * Initial release (Closes: #529094) -- David Bremner Wed, 05 Aug 2009 22:40:14 -0300 debian/dreadnaut.10000644000000000000000000000447611733230105011225 0ustar .TH DREADNAUT "1" "May 2009" "Nauty 2.4" "User Commands" .SH NAME Dreadnaut \- command line interface to nauty graph isomorphism library .SH SYNOPSIS .B dreadnaut Dreadnaut is interactive, and takes no command line arguments. Commands to read and write graphs, and compute isomorphisms, can be given on standard input, either from a script or from the keyboard. To exit, type ^D .SH COMMANDS .nf +- a : write automs v : write degrees *=# : select invariant: b : write canong w=# : set worksize +- c : canonise x : run nauty \-1 = user-defined +- d : digraph or loops y=# : set tc_level 0 = none e : edit graph z : write hashcode 1 = twopaths \-f, f=#, f=[...] : set colours 2 = adjtriang(K=0,1) g : read graph $=# : set origin 3 = triples h,H : help $$ : restore origin 4 = quadruples i : refine ? : type options 5 = celltrips I : refine using invar _ : compl __ : conv 6 = cellquads j : relabel randomly % : Mathon doubling 7 = cellquins k=# # : set invar levels & : type colouring 8 = distances(K) K=# : set invar param && : + quotient matrix 9 = indsets(K) l=# : set line length >ff : write to file 10 = cliques(K) +- m : write markers >>ff : append to file 11 = cellcliq(K) n=# : set order \-> : revert to stdout 12 = cellind(K) o : write orbits #http://www.example.com/downloads.php nauty-(.*)\.tar\.gz # Uncomment to examine a Webserver directory opts="uversionmangle=s/b(\d+)/~b$1/" \ http://cs.anu.edu.au/~bdm/nauty/nauty(\d)(\d.*)\.tar.gz debian/README.source0000644000000000000000000000102311733230105011334 0ustar Building topgit for Debian -------------------------- The nauty source package uses quilt to apply and remove its patches. Please refer to /usr/share/doc/quilt/README.source for information about how to use quilt for source packages. The quilt series is generated from the Git repository, using TopGit. This process is documented in /usr/share/doc/topgit/HOWTO-tg2quilt.gz . The nauty packages uses the branch layout described in the aforementioned document. -- David Bremner , Sun, 28 Jun 2009 14:22:07 -0300 debian/directg.10000644000000000000000000000214711733230105010670 0ustar .TH DIRECTG "1" "May 2009" "nauty 2.4" "User Commands" .SH NAME directg \- Read undirected graphs and orient their edges in all possible ways. .SH SYNOPSIS .B directg [\fI\-q\fR] [\fI\-u|\-T|\-G\fR] [\fI\-o\fR] [\fI\-f#\fR] [\fI\-e#|\-e#:#\fR] [\fIinfile \fR[\fIoutfile\fR]] .SH DESCRIPTION .IP Read undirected graphs and orient their edges in all possible ways. .IP Edges can be oriented in either or both directions (3 possibilities). Isomorphic directed graphs derived from the same input are suppressed. If the input graphs are non\-isomorphic then the output graphs are also. .TP \fB\-e\fR# | \fB\-e\fR#:# specify a value or range of the total number of arcs .TP \fB\-o\fR orient each edge in only one direction, never both .TP \fB\-f\fR# Use only the subgroup that fixes the first # vertices setwise .TP \fB\-T\fR use a simple text output format (nv ne edges) instead of digraph6 .TP \fB\-G\fR like \fB\-T\fR but includes group size as third item (if less than 10^10) .IP The group size does not include exchange of isolated vertices. .TP \fB\-u\fR no output, just count them .TP \fB\-q\fR suppress auxiliary information debian/countg.10000644000000000000000000000452511733230105010550 0ustar .TH COUNTG "1" "May 2009" "nauty 2.4" "User Commands" .SH NAME countg \- countg : Count graphs according to their properties. .SH SYNOPSIS .B [pickg|countg] [\fI\-fp#:#q \-V\fR] [\fI\--keys\fR] [\fI\-constraints \-v\fR] [\fIifile \fR[\fIofile\fR]] .SH DESCRIPTION .IP countg : Count graphs according to their properties. .IP pickg : Select graphs according to their properties. .IP ifile, ofile : Input and output files. .IP \&'\-' and missing names imply stdin and stdout. .IP Miscellaneous switches: .TP \fB\-p\fR# \fB\-p\fR#:# Specify range of input lines (first is 1) .TP \fB\-f\fR With \fB\-p\fR, assume input lines of fixed length (only used with a file in graph6 format) .TP \fB\-v\fR Negate all constraints .TP \fB\-V\fR List properties of every input matching constraints. .TP \fB\-q\fR Suppress informative output. .IP Constraints: .IP Numerical constraints (shown here with following #) can take a single integer value, or a range like #:#, #:, or :#. Each can also be preceded by '~', which negates it. (For example, \-~D2:4 will match any maximum degree which is _not_ 2, 3, or 4.) Constraints are applied to all input graphs, and only those which match all constraints are counted or selected. .TP \fB\-n\fR# number of vertices \fB\-e\fR# number of edges .TP \fB\-d\fR# minimum degree \fB\-D\fR# maximum degree .TP \fB\-r\fR regular \fB\-b\fR bipartite .TP \fB\-z\fR# radius \fB\-Z\fR# diameter .TP \fB\-g\fR# girth (0=acyclic) \fB\-Y\fR# total number of cycles .TP \fB\-T\fR# number of triangles .TP \fB\-E\fR Eulerian (all degrees are even, connectivity not required) .TP \fB\-a\fR# group size \fB\-o\fR# orbits \fB\-F\fR# fixed points \fB\-t\fR vertex\-transitive .TP \fB\-c\fR# connectivity (only implemented for 0,1,2). .TP \fB\-i\fR# min common nbrs of adjacent vertices; \fB\-I\fR# maximum .TP \fB\-j\fR# min common nbrs of non\-adjacent vertices; \fB\-J\fR# maximum .IP Sort keys: .TP Counts are made for all graphs passing the constraints. Counts .IP are given separately for each combination of values occurring for the properties listed as sort keys. A sort key is introduced by \&'\-\-' and uses one of the letters known as constraints. These can be combined: \fB\-\-n\fR \fB\-\-e\fR \fB\-\-r\fR is the same as \fB\-\-ne\fR \fB\-\-r\fR and \fB\-\-ner\fR. The order of sort keys is significant. debian/dirs0000644000000000000000000000001111733230105010035 0ustar usr/bin debian/biplabg.10000644000000000000000000000111011733230105010634 0ustar .TH BIPLABG "1" "May 2009" "nauty 2.4" "User Commands" .SH NAME biplabg \- Label bipartite graphs so that the colour classes are contiguous. .SH SYNOPSIS .B biplabg [\fI\-q\fR] [\fIinfile \fR[\fIoutfile\fR]] .SH DESCRIPTION .IP Label bipartite graphs so that the colour classes are contiguous. .IP The first vertex of each component is assigned the first colour. Vertices in each colour class have the same relative order as before. Non\-bipartite graphs are rejected. .IP The output file has a header if and only if the input file does. .TP \fB\-q\fR Suppress auxiliary information. debian/amtog.10000644000000000000000000000174211733230105010356 0ustar .TH AMTOG "1" "May 2009" "nauty 2.4" "User Commands" .SH NAME amtog \- Read graphs in matrix format. .SH SYNOPSIS .B amtog [\fI\-n#sghq\fR] [\fIinfile \fR[\fIoutfile\fR]] .SH DESCRIPTION .IP Read graphs in matrix format. .TP \fB\-n\fR# Set the initial graph order to # (no default). This can be overridden in the input. .TP \fB\-g\fR Write the output in graph6 format (default). .TP \fB\-s\fR Write the output in sparse6 format. .TP \fB\-h\fR Write a header (according to \fB\-g\fR or \fB\-s\fR). .TP \fB\-q\fR Suppress auxiliary information. .IP Input consists of a sequence of commands restricted to: .TP n=# set number of vertices (no default) The = is optional. .TP m Matrix to follow (01 any spacing or no spacing) An 'm' is also assumed if 0 or 1 is encountered. .TP M Complement of matrix to follow (as m) .TP t Upper triangle of matrix to follow, row by row .IP excluding the diagonal. (01 in any or no spacing) .TP T Complement of upper triangle to follow (as t) .TP q exit (optional) debian/clean0000644000000000000000000000050011733230105010161 0ustar planarg copyg listg labelg dretog amtog geng complg shortg showg NRswitchg biplabg addedgeg deledgeg countg pickg genrang gentourng newedgeg catg genbg directg multig dreadnaut dreadnautB makefile nauty.h naututil.h gtools.h libnauty.a *.os *.o libnauty.so.1d.0.0 libnauty.so.1d.0 libnauty.so.1d libnauty.so debian/copyg.10000644000000000000000000000154611733230105010372 0ustar .TH COPYG "1" "May 2009" "nauty 2.4" "User Commands" .SH NAME copyg \- Copy a file of graphs with possible format conversion. .SH SYNOPSIS .B copyg [\fI\-gsfp#:#qhx\fR] [\fIinfile \fR[\fIoutfile\fR]] .SH DESCRIPTION .IP Copy a file of graphs with possible format conversion. .TP \fB\-g\fR Use graph6 format for output .TP \fB\-s\fR Use sparse6 format for output In the absence of \fB\-g\fR and \fB\-s\fR, the format depends on the header or, if none, the first input line. .HP \fB\-p\fR# \fB\-p\fR#:# .IP Specify range of input lines (first is 1) .TP \fB\-f\fR With \fB\-p\fR, assume input lines of fixed length .IP (ignored if header or first line has sparse6 format). .TP \fB\-h\fR Write a header. .TP \fB\-x\fR Don't write a header. In the absence of \fB\-h\fR and \fB\-x\fR, a header is written if there is one in the input. .TP \fB\-q\fR Suppress auxiliary output. debian/libnauty1d.install0000644000000000000000000000006411733230105012625 0ustar libnauty.so.1d.0.0 /usr/lib libnauty.so.1d /usr/lib debian/control0000644000000000000000000000426311733230105010571 0ustar Source: nauty Section: non-free/math Priority: extra Maintainer: Debian Science Maintainers Uploaders: David Bremner Build-Depends: debhelper (>= 7.0.50), autotools-dev Standards-Version: 3.9.3 Homepage: http://cs.anu.edu.au/~bdm/nauty/ Vcs-Git: git://git.debian.org/git/debian-science/packages/nauty.git Vcs-Browser: http://git.debian.org/?p=debian-science/packages/nauty.git XS-Autobuild: yes Package: nauty Architecture: any Depends: ${shlibs:Depends}, ${misc:Depends} Description: command line tools to compute graph automorphisms nauty (no automorphisms, yes?) is a set of procedures for determining the automorphism group of a vertex-coloured graph. It provides this information in the form of a set of generators, the size of the group, and the orbits of the group. It is also able to produce a canonically-labelled isomorph of the graph, to assist in isomorphism testing. This package provides the main command line tool dreadnaut, and some utilities ('gtools'). A C API is also available. Package: libnauty1d Architecture: any Section: non-free/libs Depends: ${shlibs:Depends}, ${misc:Depends} Description: library to compute graph automorphisms and canonical labellings nauty (no automorphisms, yes?) is a set of procedures for determining the automorphism group of a vertex-coloured graph. It provides this information in the form of a set of generators, the size of the group, and the orbits of the group. It is also able to produce a canonically-labelled isomorph of the graph, to assist in isomorphism testing. Package: libnauty-dev Architecture: any Section: non-free/libdevel Depends: ${shlibs:Depends}, ${misc:Depends}, libnauty1d (= ${binary:Version}) Description: library for computing graph automorphisms (development files) nauty (no automorphisms, yes?) is a set of procedures for determining the automorphism group of a vertex-coloured graph. It provides this information in the form of a set of generators, the size of the group, and the orbits of the group. It is also able to produce a canonically-labelled isomorph of the graph, to assist in isomorphism testing. This package provides a C API. debian/compat0000644000000000000000000000000211733230105010357 0ustar 7 debian/NRswitchg.10000644000000000000000000000067711733230105011165 0ustar .TH NRSWITCHG "1" "May 2009" "nauty 2.4" "User Commands" .SH NAME NRswitchg \- For each v, complement the edges from N(v) to V(G)\-N(v)\-v. .SH SYNOPSIS .B NRswitchg [\fI\-lq\fR] [\fIinfile \fR[\fIoutfile\fR]] .SH DESCRIPTION .IP For each v, complement the edges from N(v) to V(G)\-N(v)\-v. .IP The output file has a header if and only if the input file does. .TP \fB\-l\fR Canonically label outputs. .TP \fB\-q\fR Suppress auxiliary information. debian/copyright0000644000000000000000000000531111733230105011114 0ustar % The format of this file is (loosely) based on % http://wiki.debian.org/Proposals/CopyrightFormat Original source download from: http://cs.anu.edu.au/~bdm/nauty/ Author : Brendan McKay Disclaimer: This program is not part of Debian, because the license discriminates against forbids selling for profit fields of endeavour, which violates the Debian Free Software Guidelines part 1 and 6 respectively (see http://www.debian.org/social_contract). Neither of these conditions impedes the autobuilding of the package. Files: * Copyright: © Brendan McKay License: Other Copyright (1984-2009) Brendan McKay. All rights reserved. Permission is hereby given for use and/or distribution with the exception of sale for profit or application with nontrivial military significance. You must not remove this copyright notice, and you must document any changes that you make to this program. This software is subject to this copyright only, irrespective of any copyright attached to any package of which this is a part. Absolutely no guarantees or warranties are made concerning the suitability, correctness, or any other aspect of this program. Any use is at your own risk. The above does not apply to the file planarity.c, which is copyright to the Magma project and distributed with nauty by permission. Files: planarity.c Copyright: ©2001-2007 Magma Project License: Other planarity.c - code for planarity testing of undirected graphs. Method of Boyer and Myrvold, programmed by Paulette Lieby. The copyright of this program is owned by the Magma project. Distributed with nauty by permission. Files: debian/* Copyright: © 2009, David Bremner License: MIT Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. debian/deledgeg.10000644000000000000000000000072011733230105011002 0ustar .TH DELEDGEG "1" "May 2009" "nauty 2.4" "User Commands" .SH NAME deledgeg \- For each edge e, output G\-e .SH SYNOPSIS .B deledgeg [\fI\-lq\fR] [\fI\-d#\fR] [\fIinfile \fR[\fIoutfile\fR]] .SH DESCRIPTION .IP For each edge e, output G\-e .IP The output file has a header if and only if the input file does. .TP \fB\-l\fR Canonically label outputs .HP \fB\-d\fR# Specify a lower bound on the minimum degree of the output .TP \fB\-q\fR Suppress auxiliary information debian/addedgeg.10000644000000000000000000000144711733230105010775 0ustar .\" DO NOT MODIFY THIS FILE! It was generated by help2man 1.36. .TH ADDEDGEG "1" "May 2009" "nauty 2.4" "User Commands" .SH NAME addedgeg \- For each edge e, output G\-e .SH SYNOPSIS .B addedgeg [\fI\-lq\fR] [\fI\-D#\fR] [\fI\-btfF\fR] [\fIinfile \fR[\fIoutfile\fR]] .SH DESCRIPTION .IP For each edge e, output G\-e .IP The output file has a header if and only if the input file does. .TP \fB\-l\fR Canonically label outputs .HP \fB\-D\fR# Specify an upper bound on the maximum degree of the output .TP \fB\-b\fR Output is bipartite if input is .TP \fB\-t\fR Output has no 3\-cycles if input doesn't .TP \fB\-f\fR Output has no 4\-cycles if input doesn't .TP \fB\-F\fR Output has no 5\-cycles if input doesn't \fB\-btfF\fR can be used in arbitrary combinations .TP \fB\-q\fR Suppress auxiliary information debian/nauty.manpages0000644000000000000000000000056611733230105012045 0ustar debian/addedgeg.1 debian/amtog.1 debian/biplabg.1 debian/catg.1 debian/complg.1 debian/copyg.1 debian/countg.1 debian/deledgeg.1 debian/directg.1 debian/dreadnaut.1 debian/dretog.1 debian/genbg.1 debian/geng.1 debian/genrang.1 debian/labelg.1 debian/listg.1 debian/multig.1 debian/newedgeg.1 debian/NRswitchg.1 debian/pickg.1 debian/planarg.1 debian/shortg.1 debian/showg.1 debian/source/0000755000000000000000000000000011733230105010461 5ustar debian/source/git-patches0000644000000000000000000000003411733230105012611 0ustar :debpatch: upstream..master debian/source/format0000644000000000000000000000001411733230105011667 0ustar 3.0 (quilt) debian/planarg.10000644000000000000000000000153411733230105010672 0ustar .TH PLANARG "1" "May 2009" "nauty 2.4" "User Commands" .SH NAME planarg \- For each input, write to output if planar. .SH SYNOPSIS .B planarg [\fI\-v\fR] [\fI\-nVq\fR] [\fI\-p|\-u\fR] [\fIinfile \fR[\fIoutfile\fR]] .SH DESCRIPTION .IP For each input, write to output if planar. .IP The output file has a header if and only if the input file does. .TP \fB\-v\fR Write non\-planar graphs instead of planar graphs .TP \fB\-V\fR Write report on every input .TP \fB\-u\fR Don't write anything, just count .TP \fB\-p\fR Write in planar_code if planar (without \fB\-p\fR, same format as input) .TP \fB\-k\fR Follow each non\-planar output with an obstruction in sparse6 format (implies \fB\-v\fR, incompatible with \fB\-p\fR) .TP \fB\-n\fR Suppress checking of the result .TP \fB\-q\fR Suppress auxiliary information .IP This program permits multiple edges and loops debian/libnauty1d.symbols0000644000000000000000000000747711733230105012666 0ustar libnauty.so.1d libnauty1d #MINVER# adjacencies@Base 2.4 adjacencies_sg@Base 2.4 adjtriang@Base 2.4 allgroup2@Base 2.4 allgroup@Base 2.4 alloc_error@Base 2.4 aresame_sg@Base 2.4 arg_int@Base 2.4 arg_long@Base 2.4 arg_range@Base 2.4 breakout@Base 2.4 cellcliq@Base 2.4 cellfano2@Base 2.4 cellfano@Base 2.4 cellind@Base 2.4 cellquads@Base 2.4 cellquins@Base 2.4 cellstarts@Base 2.4 celltrips@Base 2.4 cheapautom@Base 2.4 cheapautom_sg@Base 2.4 cliques@Base 2.4 commonnbrs@Base 2.4 complement@Base 2.4 conncontent@Base 2.4 contract1@Base 2.4 converse@Base 2.4 copycomment@Base 2.4 cyclecount1@Base 2.4 cyclecount@Base 2.4 degstats@Base 2.4 delete1@Base 2.4 diamstats@Base 2.4 dispatch_graph@Base 2.4 dispatch_sparse@Base 2.4 distances@Base 2.4 distances_sg@Base 2.4 distvals@Base 2.4 doref@Base 2.4 extra_autom@Base 2.4 extra_level@Base 2.4 fcanonise@Base 2.4 fcanonise_inv@Base 2.4 fcanonise_inv_sg@Base 2.4 fgroup@Base 2.4 fgroup_inv@Base 2.4 find_dist@Base 2.4 fixit@Base 2.4 flushline@Base 2.4 fmperm@Base 2.4 fmptn@Base 2.4 freegroup@Base 2.4 freepermrec@Base 2.4 getbigcells@Base 2.4 getecline@Base 2.4 getint@Base 2.4 girth@Base 2.4 graphsize@Base 2.4 groupautomproc@Base 2.4 grouplevelproc@Base 2.4 groupptr@Base 2.4 gt_abort@Base 2.4 gt_numorbits@Base 2.4 gtools_check@Base 2.4 gtools_getline@Base 2.4 hash@Base 2.4 indsets@Base 2.4 init_sg@Base 2.4 is_pipe@Base 2.4 isautom@Base 2.4 isautom_sg@Base 2.4 isbiconnected1@Base 2.4 isbiconnected@Base 2.4 isbipartite@Base 2.4 isconnected1@Base 2.4 isconnected@Base 2.4 issubconnected@Base 2.4 istransitive@Base 2.4 itos@Base 2.4 labelorg@Base 2.4 longprune@Base 2.4 longvalue@Base 2.4 loopcount@Base 2.4 makecosetreps@Base 2.4 maketargetcell@Base 2.4 mathon@Base 2.4 naugraph_check@Base 2.4 naugraph_freedyn@Base 2.4 nausparse_check@Base 2.4 nausparse_freedyn@Base 2.4 nautil_check@Base 2.4 nautil_freedyn@Base 2.4 nautinv_check@Base 2.4 nautinv_freedyn@Base 2.4 naututil_check@Base 2.4 naututil_freedyn@Base 2.4 nauty@Base 2.4 nauty_check@Base 2.4 nauty_freedyn@Base 2.4 nauty_to_sg@Base 2.4 newpermrec@Base 2.4 nextelement@Base 2.4 ntog6@Base 2.4 ntos6@Base 2.4 numtriangles1@Base 2.4 numtriangles@Base 2.4 ogf_linelen@Base 2.4 opengraphfile@Base 2.4 orbjoin@Base 2.4 pathcount1@Base 2.4 permcycles@Base 2.4 permset@Base 2.4 put_sg@Base 2.4 putcanon@Base 2.4 putdegs@Base 2.4 putgraph@Base 2.4 putmapping@Base 2.4 putorbits@Base 2.4 putptn@Base 2.4 putquotient@Base 2.4 putset@Base 2.4 putstring@Base 2.4 quadruples@Base 2.4 ran_arr_buf@Base 2.4 ran_arr_cycle@Base 2.4 ran_arr_dummy@Base 2.4 ran_arr_ptr@Base 2.4 ran_arr_started@Base 2.4 ran_array@Base 2.4 ran_init@Base 2.4 ran_start@Base 2.4 ran_x@Base 2.4 rangraph2@Base 2.4 rangraph@Base 2.4 ranperm@Base 2.4 read_sg@Base 2.4 read_sg_loops@Base 2.4 readg@Base 2.4 readg_code@Base 2.4 readg_line@Base 2.4 readgraph@Base 2.4 readinteger@Base 2.4 readpc_sg@Base 2.4 readpcle_sg@Base 2.4 readperm@Base 2.4 readptn@Base 2.4 readstring@Base 2.4 readvperm@Base 2.4 refine1@Base 2.4 refine@Base 2.4 refine_sg@Base 2.4 relabel@Base 2.4 s6len@Base 2.4 seed@Base 2.4 sethash@Base 2.4 setinter@Base 2.4 setnbhd@Base 2.4 setsize@Base 2.4 sg_to_nauty@Base 2.4 sgtos6@Base 2.4 shortprune@Base 2.4 sortlists_sg@Base 2.4 strhaschar@Base 2.4 stringcopy@Base 2.4 stringcounts@Base 2.4 stringtograph@Base 2.4 stringtosparsegraph@Base 2.4 sublabel@Base 2.4 targetcell@Base 2.4 targetcell_sg@Base 2.4 testcanlab@Base 2.4 testcanlab_sg@Base 2.4 tg_canonise@Base 2.4 triples@Base 2.4 twocolouring@Base 2.4 twopaths@Base 2.4 unitptn@Base 2.4 updatecan@Base 2.4 updatecan_sg@Base 2.4 writeg6@Base 2.4 writelast@Base 2.4 writeline@Base 2.4 writepc_sg@Base 2.4 writeperm@Base 2.4 writerange@Base 2.4 writes6@Base 2.4 writes6_sg@Base 2.4