Perl: the Markov chain saw PerlMonks

Re^2: Parsing HTML

by marcoss (Novice)
 on Jun 12, 2012 at 11:05 UTC ( #975750=note: print w/replies, xml ) Need Help??

```#!/usr/bin/perl -w
use LWP::Simple;
...
print "\n";
}
```
```Trip name: Fiordi norvegesi e grandi città del Baltico
price: € 2.615,00
...
Porto di partenza : Copenhagen
Documenti di viaggio : Passaporto
Picture: http://www.costacrociere.it/B2C/Images/ItineraryV4/CPH11040__
+it-IT.gif#CPH11040
```

Create A New User
Node Status?
node history
Node Type: note [id://975750]
help
Chatterbox?
 [oiskuu]: You want to draw the path? \$iter = combinations( \$TOP_HEIGHT .. \$NODE_HEIGHT, \$pos); then get the path from the iter, level change at depth x, for(..) \$pos += \$level_change; something like that [oiskuu]: yergh, tags... [\$top_height .. \$node_height] [Eily]: Discipulus by demonstrate I suppose you mean simulate with perl? [Eily]: the demonstration itself is fairly easy. The number of paths on a node is the sum of the numbers of paths to the two nodes above (or one node above on the edges of the triangle) [Eily]: since the value of a node is also the sum from the two nodes above, you just have to demonstrate that the equality is true at the top of the triangle [Discipulus]: yes Eily, thanks oiskuu but i dont get it.. ;=( maybe I'll ask a SOPW [LanX]: all combinations with same amount of left and right? [Eily]: if you want to store in a structure with the coordinates as key, arrays might do, since the keys are going to be 0..n [LanX]: (Pascale path)

How do I use this? | Other CB clients
Other Users?
Others rifling through the Monastery: (9)
As of 2018-03-19 11:16 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
When I think of a mole I think of:

Results (239 votes). Check out past polls.

Notices?