Man page - nauty-uniqg(1)
Packages contas this manual
- nauty-deledgeg(1)
- nauty-dretog(1)
- nauty-complg(1)
- nauty-pickg(1)
- nauty-dretodot(1)
- nauty-twohamg(1)
- nauty-countneg(1)
- nauty-copyg(1)
- nauty-assembleg(1)
- nauty-countg(1)
- nauty-converseg(1)
- nauty-vcolg(1)
- nauty-ransubg(1)
- nauty-gentreeg(1)
- nauty-shortg(1)
- nauty-catg(1)
- nauty-directg(1)
- nauty-labelg(1)
- nauty-sumlines(1)
- nauty-watercluster2(1)
- nauty-addptg(1)
- nauty-delptg(1)
- nauty-genspecialg(1)
- nauty-addedgeg(1)
- nauty-biplabg(1)
- nauty-nbrhoodg(1)
- nauty-genbg(1)
- nauty-checks6(1)
- nauty-hamheuristic(1)
- nauty-uniqg(1)
- nauty-newedgeg(1)
- nauty-genrang(1)
- nauty-dimacs2g(1)
- nauty-linegraphg(1)
- nauty-genktreeg(1)
- nauty-listg(1)
- nauty-cubhamg(1)
- nauty-edgetransg(1)
- nauty-subdivideg(1)
- dreadnaut(1)
- nauty-ancestorg(1)
- nauty-bliss2dre(1)
- nauty-productg(1)
- nauty-geng(1)
- nauty-genquarticg(1)
- nauty-genposetg(1)
- nauty-underlyingg(1)
- nauty-amtog(1)
- nauty-ranlabg(1)
- nauty-gentourng(1)
- nauty-planarg(1)
- nauty-showg(1)
- nauty-multig(1)
Package: nauty
apt-get install nauty
apt-get install nauty
Manuals in package:
Documentations in package:
Manual
| NAUTY-UNIQG(1) | Nauty Manual | NAUTY-UNIQG(1) |
NAME
nauty-uniqg - remove duplicates from a file of graphs or digraphs
SYNOPSIS
uniqg [-q] [-xFILE] [-Xfile] [-hFILE] [-fxxx] [-u|-S|-t]
DESCRIPTION
- [-c] [-k] [-i# -I#:# -K#] [infile [outfile]]
- Remove duplicates from a file of graphs or digraphs.
- The SHA256 cryptographic hash function is used for comparisons
- -S
- Use sparse representation internally.
- Note that this changes the canonical labelling. Multiple edges are not supported. One loop per vertex is ok.
- -t
- Use Traces.
- -u
- No output, just count
- -H
- Write hash codes, not graphs (note: binary output)
- -k
- Write the input graph exactly, not a canonical graph
- -c
- Assume graphs from infile are canonically labelled already
- -xFILE
- Read a file of graphs and exclude them from the output
- -XFILE
- Like -xFILE but assume they are already canonically labelled
- -hFILE
- Read a file of hash codes and exclude them from the output
- -F
- Flush output for each new graph (expensive if there are many)
- -fxxx
- Specify a partition of the vertex set. xxx is any
- string of ASCII characters except nul.
- This string is
- considered extended to infinity on the right with the character 'z'. The sequence 'x^N', where x is a character and N is a number, is equivalent to writing 'x' N times. One character is associated with each vertex, in the order given. The labelling used obeys these rules:
- (1) the new order of the vertices is such that the associated
- characters are in ASCII ascending order
- (2) if two graphs are labelled using the same string xxx,
- the output graphs are identical iff there is an associated-character-preserving isomorphism between them. If a leading '-' is used, as in -f-xxx, the characters are assigned to the vertices starting at the last vertex, and the new order of the vertices respects decreasing ASCII order.
- -i#
- select an invariant (1 = twopaths, 2 = adjtriang(K), 3 = triples,
- 4 = quadruples, 5 = celltrips, 6 = cellquads, 7 = cellquins, 8 = distances(K), 9 = indsets(K), 10 = cliques(K), 11 = cellcliq(K),
- 12 = cellind(K), 13 = adjacencies, 14 = cellfano, 15 = cellfano2, 16 = refinvar(K))
| February 2025 | nauty 2.8.9 |