Cart
[Home] [By Thread] [By Date] [Recent Entries]
On 03/09/2012 17:34, Costello, Roger L. wrote:
But if there are recursive references then that approach causes the program goes into an infinite loop. It should be possible to leave enough breadcrumbs to avoid looping without keeping multiple copies of the entire tree in memory. Details depend on the details.... For example you can keep a tunnel parameter that (just) stores a sequence of nodes that you have followed a reference to, then before following the next reference you come across check you haven't been there already. David -- google plus: https:/profiles.google.com/d.p.carlisle ________________________________________________________________________ The Numerical Algorithms Group Ltd is a company registered in England and Wales with company number 1249803. The registered office is: Wilkinson House, Jordan Hill Road, Oxford OX2 8DR, United Kingdom. This e-mail has been scanned for all viruses by Star. The service is powered by MessageLabs. ________________________________________________________________________
|
