- I have a cyclic directed graph.
- My job is to load the graph from disk into a relational database where links work via sequentially allocated IDs.
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 ...
If, however, you are using three tables (One for nodes, one for linktypes, and one for node/node/link), then this is trivial:
- Load all your nodes
- Load all your linktypes
- Load all your links
But, if it was that easy, you wouldn't be asking the question. *shrugs*
- 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?"