in reply to Re^2: 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.
Personally, I would create the tables for the node types and have a completely separate table that actually demonstrates the links between the nodes. I would also treat the nodes both in one tables (called nodes) and in their separate tables who FK to nodes. Kinda like a base class and child classes. That way, you can handle it as a 3-table graph when convenient, but you can also get to the data when needed.
- In general, if you think something isn't in Perl, try it out, because it usually is. :-)
- "What is the sound of Perl? Is it not the sound of a wall that people have stopped banging their heads against?"
In Section
Seekers of Perl Wisdom