Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery
 
PerlMonks  

Re^2: POE and recursion

by OverlordQ (Hermit)
on Sep 02, 2007 at 23:09 UTC ( [id://636650] : note . print w/replies, xml ) Need Help??


in reply to Re: POE and recursion
in thread POE and recursion

What I'm doing is parsing Wikipedia Categories. Using Physics as the example Input, the script would request this page.
  • The page elements with an ns attribute of zero are actual articles, and will need to be saved for processing later.
  • The page elements with an ns attribute of 14 are sub-categories which need traversed as well
EG: the first one on the page is Category:Applied and interdisciplinary physics, so the script will then request this page.

Then as above, all the page elements with ns attribute of zero are pages and saved for later, and the elements with ns attribute of 14 are added to the list of sub-categories to walk.

Once all the the subcategories are traversed, then operations are performed on the list of unique articles.

Basically what is happening is given the input, the script should walk all the branches of the tree 'below' it.

Replies are listed 'Best First'.
Re^3: POE and recursion
by rcaputo (Chaplain) on Sep 03, 2007 at 00:18 UTC

    This kind of recursion can be rewritten as iteration. Here's some untested code: