|
[Date Index]
[Thread Index]
[Author Index]
[Q] Problem with combinatorica
Hi,
I want to create random strongly connected directed graphs. So I defined
the following function:
CG[n_,p_] :=
While[True,
g := RandomGraph[n,p,Directed];
If[ConnectedQ[g,Directed], g; Break[]] ]
And to get the list of the edges in the graph I do: ToOrderedPairs[g]
However, it doesn't work and I don't know why. Thank you for your help.
-David
-------------------------------------------------------------------------
David Konopnicki - konop@cs.technion.ac.il
-------------------------------------------------------------------------
Prev by Date:
Re: Automatically loading package question
Next by Date:
Re: Deleting subscripted functions with arguments.
Prev by thread:
Re: list combinations
Next by thread:
Re: [Q] Problem with combinatorica
|