networks(deprecated)/random - Maple Help

Online Help

All Products    Maple    MapleSim


Home : Support : Online Help : networks(deprecated)/random

networks

  

random

  

creates a random graph on a given number of vertices

 

Calling Sequence

Parameters

Description

Examples

Calling Sequence

G:=random(n)

G:=random(n, m)

G:=random(n, 'prob'=x)

Parameters

G

-

graph or network

n

-

number of vertices required

m

-

number of edges (optional)

x

-

real number in [0,1] (optional, specify only if m not used)

Description

• 

Important: The networks package has been deprecated.Use the superseding command GraphTheory[RandomGraphs] instead.

• 

This procedure generates a variety of different types of random graphs. If only one argument n is specified, this is taken to be the number of vertices, and each edge of the complete graph on n vertices is assumed to be present with a probability of 1/2.

• 

Extra arguments can be used to specify the number of edges m or the specific independent probability x with which a given edges occurs.

• 

If m is specified, a random n-vertex m-edge simple undirected graph is constructed.

• 

If x is specified, each undirected edge is chosen for inclusion "independently" with probability x.

• 

This routine is normally loaded by using the command with(networks), but it may also be referenced by using the full name networks[random](...).

Examples

Important: The networks package has been deprecated.Use the superseding command GraphTheory[RandomGraphs] instead.

withnetworks:

Grandom4:

endsG

1,2,1,3,1,4,2,4

(1)

Grandom4,prob=1:

endsG

1,2,1,3,1,4,2,3,2,4,3,4

(2)

Grandom5,8:

endsG

1,2,1,3,1,4,1,5,2,4,2,5,3,4,3,5

(3)

See Also

GraphTheory

GraphTheory[RandomGraphs]

networks(deprecated)[addedge]

networks(deprecated)[new]

networks(deprecated)[petersen]

with