Beefy Boxes and Bandwidth Generously Provided by pair Networks
Just another Perl shrine

Re^2: Introduction to Parallel::ForkManager

by fullermd (Priest)
on Aug 07, 2009 at 21:40 UTC ( #786942=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://786942]
    [LanX]: (Pascale path)
    [Eily]: paths like that
    [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)
    [LanX]: oh I meant fixed amount
    [LanX]: every path must have l left and r right edges and l and r are fixed and l+r is the height
    [LanX]: simple recursive function which goes left and right till l or r are exhausted
    LanX #solved

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

      Results (239 votes). Check out past polls.