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-roo...
Sent from the Drools: User forum mailing list archive at
Nabble.com.