On Mon, Aug 31, 2020 at 11:59 AM vitalije <[email protected]> wrote:
A pair (v, count) where count is integer showing how many times this same v > node was seen during the traversal, can be used to make distinction between > clones. > An interesting idea. Let me think about it. > This scheme can also be broken by outline change, when this change affects > ordering of clones, but it is resilient against inserting and deleting new > nodes, and moving nodes that are not ancestors of a node. > In this case, broken "links" are tolerable, because expansion state is not crucial. I plan to experiment with your proposal. Edward -- You received this message because you are subscribed to the Google Groups "leo-editor" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/leo-editor/CAMF8tS3hbrx2XCkRjFQKAJhyNF9n4h2otJoA_GQNr3QF5n97Xg%40mail.gmail.com.
