generate a random network
positive integer, larger than 1
numeric value between 0.0 and 1.0
list of vertices
(optional) equation(s) of the form option=value where option is one of acyclic, seed, or weights
acyclic = truefalse
If the option acyclic is specified, a random acyclic network is created.
seed = integer or none
Seed for the random number generator. When an integer is specified, this is equivalent to calling randomize(seed).
weights = range or procedure
If the option weights=m..n is specified, where m≤n are integers, the network is a weighted graph with edge weights chosen from [m,n] uniformly at random. The weight matrix W in the graph has datatype=integer, and if the edge from vertex i to j is not in the graph then W[i,j] = 0.
If the option weights=x..y where x≤y are decimals is specified, the network is a weighted graph with numerical edge weights chosen from [x,y] uniformly at random. The weight matrix W in the graph has datatype=float, that is, double precision floats (16 decimal digits), and if the edge from vertex i to j is not in the graph then W[i,j] = 0.0.
If the option weights=f where f is a function (a Maple procedure) that returns a number (integer, rational, or decimal number), then f is used to generate the edge weights. The weight matrix W in the network has datatype=anything, and if the edge from vertex i to j is not in the graph then W[i,j] = 0.
RandomNetwork(n,p) creates a directed unweighted network on n vertices. The larger p is, the larger the number of levels in the network.
RandomNetwork(V,p) does the same thing except that the vertex labels are chosen from the list V.
You can optionally specify q which is a numeric value between 0.0 and 1.0. The result is a random network such that each possible arc is present with probability q. The default value for q is 0.5.
The random number generator used can be seeded using the seed option or the randomize function.
N ≔ RandomNetwork⁡10,0.5
N≔Graph 1: a directed graph with 10 vertices and 28 arc(s)
N ≔ RandomNetwork⁡a,b,c,d,e,0.5,acyclic
N≔Graph 2: a directed graph with 5 vertices and 6 arc(s)
N ≔ RandomNetwork⁡10,0.2,acyclic,weights=1..5
N≔Graph 3: a directed weighted graph with 10 vertices and 31 arc(s)
Download Help Document