We don't bite newbies here... much PerlMonks

### Re^3: undefined symbol: PL_thr_key

 on Jan 02, 2013 at 21:26 UTC ( #1011352=note: print w/replies, xml ) Need Help??

in reply to Re^2: undefined symbol: PL_thr_key

Thank you so much for not disregarding the quesion... I had recompiled Perl without threading and couldn't figure out what the problem was until I read your response! Thanks again!

Create A New User
Node Status?
node history
Node Type: note [id://1011352]
help
Chatterbox?
 [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) [Discipulus]: yes Eily++ (very keen) I want to integrate my project with a 17th experiments. I want to colorize in sequence all paths [oiskuu]: Yeah, modifry the recursive func combinations() to return not the number, but the paths themselves. [Eily]: Discipulus I'd do that by starting from the bottom node I think. That way it can inherit the paths from the two nodes above (and so on, recursively)

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?