|
|
|
| There's more than one way to do things | |
| PerlMonks |
Re^3: Efficient partial deep cloningby exussum0 (Vicar) |
| on Jan 08, 2008 at 15:32 UTC ( [id://661107]=note: print w/replies, xml ) | Need Help?? |
|
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?
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||||||