Man page - nauty-genrang(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-GENRANG(1) | Nauty Manual | NAUTY-GENRANG(1) |
NAME
nauty-genrang - generate random graphs
SYNOPSIS
genrang [-P#|-P#/#|-e#|-r#|-R#|-d#] [-M#] [-l#] [-m#] [-t] [-T] [-a] [-s|-g|-z] [-S#] [-q] n|n1,n2 num [outfile]
DESCRIPTION
- Generate random graphs.
- n
- : number of vertices
- n1,n2 : number of vertices (bipartite graph)
- num : number of graphs
- A bipartite variant is only available if specified below.
- -s
- : Write in sparse6 format (default)
- -g
- : Write in graph6 format
- -z
- : Make random digraphs and write in digraph6 format
-P#/# : Give edge probability; -P# means -P1/#.
- Bipartite version available.
-e# : Give the number of edges
- Bipartite version available.
-r# : Make regular of specified degree
-d# : Make regular of specified degree (pseudorandom)
- With -z, #-in #-out digraph without loops
- Bipartite version: this is the degree on the first side.
-M# : In conjunction with -d, make the distribution more uniform
- by running a Markov chain for #*n steps starting at the pseudorandom graph.
-R# : Make regular of specified degree but output
- as vertex count, edge count, then list of edges
-l# : Maximum loop multiplicity (default 0)
-m# : Maximum multiplicity of non-loop edge (default and minimum 1)
- -t
- : Make a random spanning tree of a complete graph
- or complete bipartite graph
-S# : Specify random generator seed (default nondeterministic)
- -q
- : suppress auxiliary output
| February 2025 | nauty 2.8.9 |