in reply to Re^3: In search of an algorithm for loading cyclic graphs
in thread In search of an algorithm for loading cyclic graphs
I'm not understanding something because that looks like you're creating a table for each node type and the rows of said tables are the edges.
You've got it. The only part you're missing is that isn't "just" a graph system. It's Krang, the purpose of which is not to be a general graph implementation but rather to publish webpages. The fact that dumping and loading data is essentially a cyclic-graph-loading problem is more a side-effect than a design goal.
In this case each node type is a completely different kind of data - stories, templates, media, categories, users, etc. The links are forgeign keys in the tables, category_id in the media table for example.
Does that make sense?
-sam
|
---|
Replies are listed 'Best First'. | |
---|---|
Re^5: In search of an algorithm for loading cyclic graphs
by dragonchild (Archbishop) on May 17, 2005 at 18:52 UTC | |
by samtregar (Abbot) on May 17, 2005 at 18:58 UTC |
In Section
Seekers of Perl Wisdom