Re: [X] Tree/Graph structure in many-to-many relationship, avoiding/detecting circularity

In article <a5nh7d$hj8$1_at_news.hccnet.nl>, "OddesE" <OddesE_XYZ_at_hotmail.com> wrote:

That's a familiar problem. One way to find the circuits is to build the transitive closure and look for nodes which have themselves as descendants. That's the method I've used in the past.

I put a conceptual version of the code for transitive closure up at http://willets.org/tc.sql. I may clean it up soon and convert it to PL/SQL. It's based on Warshall's algorithm. Sorry if the code is dense.

Good luck,

Kendall Received on Fri Mar 01 2002 - 12:58:13 CST