Man page - nauty-assembleg(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-ASSEMBLEG(1) | Nauty Manual | NAUTY-ASSEMBLEG(1) |
NAME
nauty-assembleg - assemble input graphs as components of output graphs
SYNOPSIS
assembleg -n#|-n#:# [-i#|i#:#] [-k#|k#:#] [-L] [-q] [-c] [infile [outfile]]
DESCRIPTION
- Assemble input graphs as components of output graphs.
- The output file has no header. If the input has any directed graphs, all outputs are directed. Otherwise, the output format is determined by the header
- or first input.
- The input graphs had better all fit into memory at once,
- unless -L is given, in which case only the graphs of at most half the output size are stored at once.
- The output graphs will be non-isomorphic if the input
- graphs are connected and non-isomorphic.
- -n# -n#:#
- Give range of output sizes (compulsory)
- -i# -i#:#
- Give range of input sizes to use
- -k# -k#:#
- How many input graphs to combine (default -k2:)
- -L
- Assume all input graphs strictly larger than maxn/2
- vertices follow any smaller graphs in the input, where maxn is the largest size specified by -n. This can greatly reduce memory consumption.
- -c
- Also write graphs consisting of a single input
- (equivalent to -k1:, overridden by -k)
| February 2025 | nauty 2.8.9 |