If G is a weighted graph, AssignEdgeWeights(G,...) assigns new random edge weights to G, i.e., for each edge (i,j) in G the (i,j)'th entry in the weight matrix of G is updated inplace.

If G is an unweighted graph, a weighted graph is first created before assigning the edge weights.  The structure of G is not copied.

AssignEdgeWeights(G,m..n) assigns the edges of the weighted graph random integer weights uniformly distributed on [m,n].

AssignEdgeWeights(G,a..b) assigns the edges of the weighted graph random decimal weights uniformly distributed on [a,b).

AssignEdgeWeights(G,R) assigns the edges of the weighted graph G values defined by R().  The Maple procedure R must return numerical values, i.e., integers, rationals, or floating point constants.

The random number generator used to compute the edge weights can be seeded using the randomize function.

B := proc() if U()=1 then 1 else 2 fi end: