On 2012-12-15 06:13, timothy adigun wrote:
Using Dr., Ruud's data. This is another way of doing it:
[solution using a hash]
Realize that with keys(), the input order is not preserved.
Another difference is that when a key comes back later,
the hash solution will collide those, which is eithe
Hi,
I am trying to write a minimal web crawler. The aim is to discover new
URLs from the seed and crawl these new URLs further. The code is as follows:
use strict;
use warnings;
use Carp;
use Data::Dumper;
use WWW::Mechanize;
my $url = "http://foobar.com";; # example
my %links;
my $mech = W
