Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl-Sensitive Sunglasses
 
PerlMonks  

Re^2: Graph Theory, Perl, and the Six Degrees of Wikipedia (fun paths)

by amarquis (Curate)
on May 28, 2008 at 14:26 UTC ( #688867=note: print w/replies, xml ) Need Help??


in reply to Re: Graph Theory, Perl, and the Six Degrees of Wikipedia (fun paths)
in thread Graph Theory, Perl, and the Six Degrees of Wikipedia

Finding interesting paths not through dates or lists is difficult. It would be interesting to develop some heuristic for eliminating them (maybe links per volume?) and do so. I think, at least, it would increase the humor per attempt when searching between random things.

  • Comment on Re^2: Graph Theory, Perl, and the Six Degrees of Wikipedia (fun paths)

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://688867]
help
Chatterbox?
erix is not interested what the imbecile-in-chief has to say -- only what he will do
[GotToBTru]: that sounds fair to me
[davies]: I've just "approved" using syscalls in perl through inline c for at least the third time, but it still appears to me as unapproved. Is this just me?
[LanX]: erix: other side of the pond
[LanX]: davies: same problem

How do I use this? | Other CB clients
Other Users?
Others about the Monastery: (16)
As of 2017-01-16 15:03 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Do you watch meteor showers?




    Results (151 votes). Check out past polls.