Re^3: Tallying appearance of a unique string from hash keys

PerlMonks is not a code-writing service. You must at least make some minimal effort on your own. Start by trying to write your own subroutine; if you get stuck, feel free to come back and ask more specific questions, and show your code!

HTH,

planetscape

Comment on Re^3: Tallying appearance of a unique string from hash keys

Replies are listed 'Best First'.
Re^4: Tallying appearance of a unique string from hash keys by Anonymous Monk on Mar 27, 2009 at 18:29 UTC
Hello, I'm not sure how exactly to create a three random networks of these IDs. If I reorder either $1 or $2, I would accomplish this, then simply use the code above to determine the degrees and frequencies of this new network. What functions would allow me to change the order of the ID pairs in the keys of this hash, or change the order of $1 and/or $2 and place them into a new hash? Any help would be appreciated!	[reply]

Replies are listed 'Best First'.

Re^4: Tallying appearance of a unique string from hash keys
by Anonymous Monk on Mar 27, 2009 at 18:29 UTC

Hello, I'm not sure how exactly to create a three random networks of these IDs. If I reorder either $1 or $2, I would accomplish this, then simply use the code above to determine the degrees and frequencies of this new network. What functions would allow me to change the order of the ID pairs in the keys of this hash, or change the order of $1 and/or $2 and place them into a new hash? Any help would be appreciated!

[reply]