Hello everybody. I’m in a big big mess, trying to figure out how to do this for the last couple of days. I finaly came to the conclusion that I need a recursive function for what I’m trying to do.
Because it’s a little hard to explain what I need… I’ll make an example.
So… I have the figure below. I mean… that’s what I’m trying to achieve. For that figure I have data stored in the folowing way.
_root.marc is an Array.
All the paths that leave a square … like From M0 if you choose 1 you’ll get M1,
From M0 through 5 you’ll get to M3… and so on.
this is stored like
_root.marc[0].p - the paths. If _root.marc[x].p.length is 0… that means that Mx is the last one… and has no paths assigned, like shown in the figure.
My very big problem is that I need to position that MC’s… M3,M4… all of them, according to the paths above them.
So, to position M2, i need to take a look at M1, and if it has any paths, more than one path, I need to move it further down. But this is not the end of it. If M1 has more paths that lead to other MC-s… i need to take in considerations their paths too :(. This drove me mad for the last couple of days, and my time is slowly running out for my diploma 
What I’ve tryed till now was to build a function let’s say… getNextY(m) that should return a number. A “ponder”?..
like…to use it in a line like
M2._y = (currIndex + [color=red]getNextY(1)[/color])*dy;// here it should return 5 for instance
M3._y = (currIndex + [color=red]getNextY(2)[/color])*dy;// here getNextY should return 1
Why 5 or one? because it needs to take into account only if the paths are greater than 1.
CRAZY :red:
If any one could help me with this I would be … I would… I would cry 
and be greatfull for eternity … I guess.
