Re: trees, trees, trees
From: geos <geos_at_nowhere.invalid>
Date: Thu, 21 Jun 2012 02:15:53 +0200
Message-ID: <jrtp3k$pvs$1_at_news.task.gda.pl>
Gerard H. Pille wrote:
> Use a tree walk (hierarchical query) to find the parent, if any, and
> another to find all children of that parent.
Date: Thu, 21 Jun 2012 02:15:53 +0200
Message-ID: <jrtp3k$pvs$1_at_news.task.gda.pl>
Gerard H. Pille wrote:
> Use a tree walk (hierarchical query) to find the parent, if any, and
> another to find all children of that parent.
closer inspection of the data reveals that those are not trees or hierarchies but oriented graphs, some without root node. this makes it more complicated.
is there any way to identify all nodes which compose a graph for each edge entry in the table?
thank you,
geos
Received on Wed Jun 20 2012 - 19:15:53 CDT