1NAUTY-SHORTG(1) Nauty Manual NAUTY-SHORTG(1)
2
6 nauty-shortg - remove isomorphs from a file of graphs
7
9 shortg [-qvkdu] [-i# -I#:# -K#] [-fxxx] [-S|-t] [-Tdir] [-Z#] [infile
10 [outfile]]
11
13 Remove isomorphs from a file of graphs.
14 If outfile is omitted, it is taken to be the same as infile If
16 both infile and outfile are omitted, input will be taken
17 from stdin and written to stdout
19 The output file has a header if and only if the input file does.
21 -s force output to sparse6 format
23 -g force output to graph6 format
25 -z force output to digraph6 format If none of -s, -z, -g are given,
27 the output format is determined by the header or, if there is
28 none, by the format of the first input graph. The output format
29 determines the sorting order too. As an exception, digraphs are
30 always written in digraph6 format.
31 -S Use sparse representation internally. Note that this changes the
33 canonical labelling. Multiple edges are not supported. One
34 loop per vertex is ok.
35 -t Use Traces. Note that this changes the canonical labelling.
37 Multiple edges,loops, directed edges are not supported, nor in‐
38 variants.
39 -k output graphs have the same labelling and format as the inputs.
41 Without -k, output graphs have canonical labelling. -s, -g, -z
42 are ineffective if -k is given.
43 -v write to stderr a list of which input graphs correspond to which
45 output graphs. The input and output graphs are both numbered be‐
46 ginning at 1. A line like
47 23 : 30 154 78
49 means that inputs 30, 154 and 78 were isomorphic, and produced
51 output 23.
52 -d include in the output only those inputs which are isomorphic to
54 another input. If -k is specified, all such inputs are included
55 in their original labelling. Without -k, only one member of
56 each nontrivial isomorphism class is written, with canonical la‐
57 belling.
58 -fxxx Specify a partition of the point set. xxx is any
60 string of ASCII characters except nul.
62 This string is
63 considered extended to infinity on the right with the character
65 'z'. One character is associated with each point, in the order
66 given. The labelling used obeys these rules:
67 (1) the new order of the points is such that the associated
69 characters are in ASCII ascending order
71 (2) if two graphs are labelled using the same string xxx,
73 the output graphs are identical iff there is an associated-char‐
75 acter-preserving isomorphism between them.
76 -i# select an invariant (1 = twopaths, 2 = adjtriang(K), 3 =
78 triples,
79 4 = quadruples, 5 = celltrips, 6 = cellquads, 7 = cellquins, 8 =
81 distances(K), 9 = indsets(K), 10 = cliques(K), 11 = cellcliq(K),
82 12 = cellind(K), 13 = adjacencies, 14 = cellfano, 15 = cell‐
84 fano2, 16 = refinvar(K))
85 -I#:# select mininvarlevel and maxinvarlevel (default 1:1)
87 -K# select invararg (default 3)
89 -u Write no output, just report how many graphs it would have out‐
91 put. In this case, outfile is not permitted.
92 -Tdir Specify that directory "dir" will be used for temporary disk
94 space by the sort subprocess.
96 The default is usually /tmp.
97 -Z# Specify memory for sorting (number followed by %,K,M, or G)
99 -q Suppress auxiliary output
101nauty 2.8.8 November 2023 NAUTY-SHORTG(1)