http://qs1969.pair.com?node_id=457937


in reply to Re: In search of an algorithm for loading cyclic graphs
in thread In search of an algorithm for loading cyclic graphs

What do you mean when you say that you 'apply a local fix' - how is what you describe a 'fix' for anything? (You still end up with the cycles in the database, which I gather you want to do)

I mean I fix the code so it doesn't die() or loop forever anymore. A typical break is either an error about not being about the find the object linked to, or worse, an infinite loop loading the same nodes over and over.

The cycles are perfectly valid, so I'm not trying to weed them out.

Why would you be creating the id for A 'early' when you would normally generate the ids in order?

Here's the "normal" course of events in my system:

That works great until the code finds a cycle. When I run into a cycle I fix it to:

The problem is that doing this for each node type when I find a break is a real pain.

-sam