On Dec 29, 2:50 pm, "Ville M. Vainio" <[email protected]> wrote: > I recreate the structure in leoqviewer, but this is c++ code. Dumb > algorithm to create the tree is easy to do for python Leo as well, but if I > write full file format support I'd like to do it the fast way - first > create nodes, then put them to their place in the graph, in just 2 passes.
I am able to recreate nodes from the sqlite db but I do not fully understand how your edges scheme can be used to recreate a tree design. It seems easier to simply give the db a field that tells whether a node is a child of another node and if so, which one. Am I missing something? -- You received this message because you are subscribed to the Google Groups "leo-editor" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/leo-editor?hl=en.
