Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical

Re^2: random pairs

by Perlbotics (Canon)
on Jul 13, 2012 at 20:26 UTC ( #981716=note: print w/replies, xml ) Need Help??

in reply to Re: random pairs
in thread random pairs

Unfortunately, that algorithm does not avoid unwanted pairs like [1,23] and [23,1].

Here is a naive try until it works approach:

use strict; use warnings; use List::Util qw(shuffle); my (%keys, @rnds, @pairs); do { %keys = (); @rnds = shuffle (0..99); @pairs = map{ my $r = $rnds[$_]; $keys{"$_,$r"}++; $keys{"$r,$_"}++; [ $_, $r ] } (0..99); } while ( scalar keys %keys != 200 ); # no symmetry means 200 distinct + pairs # @pairs = shuffle( @pairs ); # uncomment if wanted printf( "%3d %3d\n", @{$pairs[$_]}) for (0..99);

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://981716]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (6)
As of 2016-12-08 20:47 GMT
Find Nodes?
    Voting Booth?
    On a regular basis, I'm most likely to spy upon:

    Results (146 votes). Check out past polls.