Re: [Boston.pm] Combining the nodes reachable in n steps from a web page into one printable file

2005-09-15 Thread Uri Guttman
> "TS" == Tolkin, Steve <[EMAIL PROTECTED]> writes: TS> Checking if your kit is complete... TS> Looks good TS> Warning: prerequisite LWP::UserAgent 2.024 not found. We have 1.004. TS> Warning: prerequisite Test::LongString 0 not found. TS> Warning: prerequisite URI 1.25 not found.

Re: [Boston.pm] Combining the nodes reachable in n steps from a web page into one printable file

2005-09-15 Thread Ricker, William
I didn't notice or use a bundle. CPANPLUS will handle dependencies they say, but I just kept grabbing modules until it shut up. # 1. What might cause IO::Socket::INET->new to fail? # I *am* directly connected to the Internet, so the first warning is probably caused by a proxy problem. No, you

Re: [Boston.pm] Combining the nodes reachable in n steps from a web page into one printable file

2005-09-15 Thread Tolkin, Steve
Summary: 1. What might cause IO::Socket::INET->new to fail? 2. Is there a bundle for WWW-Mechanize? Details: I went to http://search.cpan.org/dist/WWW-Mechanize/ and read the doc and it looks promising. I downloaded the tar.gz file, extracted all its files, and started the usual install

[Boston.pm] Combining the nodes reachable in n steps from a web page into one printable file

2005-09-14 Thread Tolkin, Steve
This seems like a problem that would be easily solved with a small perl script. Many web pages have a large list of links. I would like to follow all the links, to some small depth (typically just 1) and put their output into one file, in some format suitable for printing. I am flexible about