Given a set of nodes and directed edges (from parent to child node), is it possible to construct an indexed set S_Children(i_node) that contains all children of the specified node?
With all children I mean the set of all reachable nodes, starting from i_node.
For example:
s_Nodes := {A, B, C}
s_Edges := {(A, B), (B, C)}
Then I would want:
s_Children(A) := {B, C}
Edit:
The edges are actually defined through a binary parameter. i.e.
p01_edge(A, 
:= 1;
p01_edge(B, C) := 1;
Best answer by LowBjorn
I have found a recursive solution allong the following lines:
s_Children(i_node) to contain all direct descendantss_ChildrenAux(i_node) to contain all direct descendants of each node in s_Children(i_node), minus the nodes already contained in s_Children(i_node)s_ChildrenAux(i_node) to the set s_Children(i_node) and clear the auxiliary set.
It works, and is quick enough. If there’s an answer without a loop I would still be very interested.
+5@mohansx I just realised that the formulation of my question was a little off compared to my aimms structure. In fact, the edges are defined through a binary parameter that indicates if an edge exists from node1 to node2. e.g. p01_EdgeExists(node1, node2) := 1; indicates that there is an edge.
I updated my post.
I have found a recursive solution allong the following lines:
s_Children(i_node) to contain all direct descendantss_ChildrenAux(i_node) to contain all direct descendants of each node in s_Children(i_node), minus the nodes already contained in s_Children(i_node)s_ChildrenAux(i_node) to the set s_Children(i_node) and clear the auxiliary set.
It works, and is quick enough. If there’s an answer without a loop I would still be very interested.
+5Already have an account? Login
Please use your business or academic e-mail address to register
No account yet? Create an account
Enter your E-mail address. We'll send you an e-mail with instructions to reset your password.
Didn't find what you were looking for? Try searching on our documentation pages: