Terms like "root" and "parent" are used with trees. You might call these nodes "nodes with indegree 0". -W
On 18/06/2014, Borris <bor...@chaos.org.uk> wrote: > Good question. I'm supporting a graph rather than a tree, so theoretically > there could be more than one node that has no parents. But in my particular > use case I am constraining the data so that there is never more than one > root node. > > So how to find the root node (singular) from an arbitrary node in the graph > is my goal. > > > > -- > View this message in context: > http://drools.46999.n3.nabble.com/Noob-question-graph-searching-query-root-node-for-a-given-node-tp4030091p4030096.html > Sent from the Drools: User forum mailing list archive at Nabble.com. > _______________________________________________ > rules-users mailing list > rules-users@lists.jboss.org > https://lists.jboss.org/mailman/listinfo/rules-users > _______________________________________________ rules-users mailing list rules-users@lists.jboss.org https://lists.jboss.org/mailman/listinfo/rules-users
