NodeReaper has asked for the wisdom of the Perl Monks concerning the following question:

Replies are listed 'Best First'.
Re: Paths for elements
by Anonymous Monk on Jul 03, 2001 at 09:01 UTC
    To understand the solution, all you have to do is read and understand the chapter that was assigned to you prior to this homework being assigned to you. :)
      Nop, It's not a homework. It's the classical problem, which I want to know how to do with perl when there are large number of elements. With small number of elements, this is fast.. I did with perl. May be with less complicated algorithm. Also, I am looking for the test cases. Perl involves here may be with Storage or Data::Dumper or Tie... It involves with efficient storage and retrieval and display via CGI. Thanks,
        So show us what you've done so far. Your initial node was culled because it had so little content to it. Your latest effort was a little better, but not much. You have to work a little harder in order to get useful responses (and not annoy people).