Re^3: Efficient partial deep cloning

Can't you use something like the reference of the current "thing" and the "thing" to be considered to be copied as a key in a hashset? Everytime you encounter those two things in that relationsip, process it once and only once?

Or.. create an algorithm to do a breadth first search (can be less memory intense) to discover all edges and copy them in a graph?

Comment on Re^3: Efficient partial deep cloning

Replies are listed 'Best First'.
Re^4: Efficient partial deep cloning by Ovid (Cardinal) on Jan 09, 2008 at 10:29 UTC
In my current implementation, I use a `%seen` hash which tracks those references. Very easy to implement. Cheers, Ovid New address of my CGI Course.	[reply]