Ye]]>yeliu2008-08-22T08:10:09-00:00Re: [MOFScript]transformation codehttps://www.eclipse.org/forums/index.php/mv/msg/125555/620464/#msg_620464
I wrote this answer after answering your newer post.

I guess approach to take will vary depending on what you want to
acheive, or what the rules for the output are. Do you want to calculate
all paths from a to d? Or is the rule more like:
if node only has one outconnection
print that connection
etc
What I am trying to get at is how are the rules formulated that say that
the next line to print is not b->b1 then b->b2 and b->b3?

As mentioned in the earlier post this case smells a bit of recursion (or
nested forEach loops)

I guess approach to take will vary depending on what you want to
acheive, or what the rules for the output are. Do you want to calculate
all paths from a to d? Or is the rule more like:
if node only has one outconnection
print that connection
etc
What I am trying to get at is how are the rules formulated that say that
the next line to print is not b->b1 then b->b2 and b->b3?

As mentioned in the earlier post this case smells a bit of recursion (or
nested forEach loops)