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!
Regard
1) What is inactiveList doing. Nodes are added but never used.
[Simon]
It contains all feasible breakpoints except those that are still
active, i.e., are still in scope as the start of a line ending at the
currently considered breakpoint. At the end of the loop the active
list only contains nodes
On Thu, Dec 02, 2004 at 08:42:30PM +0100, Finn Bock wrote:
> Hi
>
> Some more questions.
>
> 1) What is inactiveList doing. Nodes are added but never used.
It contains all feasible breakpoints except those that are still
active, i.e., are still in scope as the start of a line ending at the
curre
Hi
Some more questions.
1) What is inactiveList doing. Nodes are added but never used.
2) If there is no shrink in a line (the case in START alignment) then
nodes are never removed from activeList until a forced break element is
found. Is that really the intention of the algorithm? It seems suspe
