Finn Bock wrote: > Ok, so it isn't really needed when the algorithm is implemented in java. > Just by having the previous node linked from within bestActiveNode is > enough to keep the inactive nodes alive. > > So inactiveList can be removed.
You are right, I'm going to remove it.
Thanks!
Regards,
Luca
