Beefy Boxes and Bandwidth Generously Provided by pair Networks
more useful options

Re: Perl "new" command

by tobyink (Abbot)
on Mar 01, 2012 at 07:15 UTC ( #957118=note: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download

    Log In?

    What's my password?
    Create A New User
    Node Status?
    node history
    Node Type: note [id://957118]
    [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, <code> 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)
    [Eily]: paths like that

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

      Results (239 votes). Check out past polls.