Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask

Thanks - Re: DBI with 2nd mysql server, nonstandard port

by Kozz (Friar)
on Feb 27, 2005 at 20:02 UTC ( #434913=note: print w/replies, xml ) Need Help??

in reply to DBI with 2nd mysql server, nonstandard port

Thank you to both monks who provided invaluable advice. It hadn't occurred to me that MySQL had changed so much as to create issues with connections & authentication via DBI. A big ++ to both of you.
  • Comment on Thanks - Re: DBI with 2nd mysql server, nonstandard port

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://434913]
[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
[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
Find Nodes?
    Voting Booth?
    When I think of a mole I think of:

    Results (239 votes). Check out past polls.