#read IDs into %edges using match operator /(\S*)(\t)(\S*)/ and special variables $1, $3 for each ID per line #assign IDs as format $edge{ID1,ID2} #skip edge assignment if ID2,ID1 already exists .. the network needs to be undirected such that ID2-ID1 is equivalent to ID1-ID2 and should therefore not be counted twice #populate hash of unique IDs from %edges #create array of unique IDs from hash of unique IDs .... @uniqIDs, $uniqIDs[0]=ID1, uniqIDs[1]=ID2 etc .. how do i do this? #initialize degree counter hash (IDs are keys, values are degrees) using @uniqIDs with foreach #go through %edges and increment %counter for each ID #generate random network with rand(int(scalar(@uniqIDs))), discard random picks if they already exist or represent undirected equivalent #initialize random network degree counter hash, and then count random network degrees as before #### my $filename = "edges.txt"; #Set a variable for our file name open(my $fh, "<", $filename) or die "Can't open file $filename."; #Open the file edges.txt while (<$fh>) { if ($_ =~ m/(\S+)\t(\S+)/) { #Match the IDs in the file to $1 and $2 $edge{$1,$2}= $holder; #assign IDs as format $edge{ID1,ID2} close $fh; #Close the file edges.txt my @list = keys %uniqedge; print "@list\n"; #Prints the list of keys, but they are uni-directional (i.e. repeated for ID1-ID2 and ID2-ID1)