in reply to Re: In search of an algorithm for loading cyclic graphs
in thread In search of an algorithm for loading cyclic graphs
If you have A -> B -> A, what do you expect your table to look like? I don't think that using sequential IDs will work that well ...
Table A a_id | b_id ----------- 1 1 Table B b_id | a_id ----------- 1 1
Each table has its own pool of sequential IDs, like most databases.
If, however, you are using three tables (One for nodes, one for linktypes, and one for node/node/link), then this is trivial:
Nope, it's not that simple. Each node type has its own table structure and most of them are more complicated than that.
-sam
|
---|
Replies are listed 'Best First'. | |
---|---|
Re^3: In search of an algorithm for loading cyclic graphs
by dragonchild (Archbishop) on May 17, 2005 at 18:37 UTC | |
by samtregar (Abbot) on May 17, 2005 at 18:43 UTC | |
by dragonchild (Archbishop) on May 17, 2005 at 18:52 UTC | |
by samtregar (Abbot) on May 17, 2005 at 18:58 UTC | |
Re^3: In search of an algorithm for loading cyclic graphs
by dynamo (Chaplain) on May 17, 2005 at 18:38 UTC | |
by samtregar (Abbot) on May 17, 2005 at 18:46 UTC |
In Section
Seekers of Perl Wisdom