>
> 0) take a connected random graph (call graphs.RandomGNP in a loop, until
> you get something connected)
> 1) take a random ordering of vertices, say v1,v2,...,vn.
>
2) orient each edge (vi,vj) in the direction j>i.
>
This last step is actually a good idea, I didn't think of this way of
gett
I would have done the following:
0) take a connected random graph (call graphs.RandomGNP in a loop, until
you get something connected)
1) take a random ordering of vertices, say v1,v2,...,vn.
2) orient each edge (vi,vj) in the direction j>i.
While this might not be uniform on the probability spa
