Re: Tallying co-occurence of numbers

[choroba]

If the order of the pair is not important, always store the lesser number first.

#!/usr/bin/perl
use warnings;
use strict;

my %count;
while (<>) {
    my @F1 = split /\t/;
    my @F2 = split /\t/, <>;

    my ($num, $from, $to) = (@F1[ 1, 2 ], $F2[2] );
    ($from, $to) = ($to, $from) if $from > $to;
    ++$count{$num}{$from}{$to};
}

[K_Edw]

I didn't think of that, thank you.