On Tue, Jul 7, 2009 at 9:39 AM, Terry Brown <[email protected]> wrote:
> > On Tue, 7 Jul 2009 05:30:22 -0500 > "Edward K. Ream" <[email protected]> wrote: > > > > From a graph theoretic point of view, tnodes model vertices and > > > vnodes model edges. > > > > In the one-node world, vnodes model nodes, and v.children models the > > (directed) links from v to its children. This is a far simpler (and > > thus far better) model than the vnode/tnode model. This ends the > > debate as far as I am concerned. > > I think derwisch's point was that you lose the vnode uA for > annotating / attributing the edge. Because v.children entries don't > carry attributes. > > I don't think it's a problem, if you want to model graphs directly in > leo's data structure you can use leo-nodes to model both graph nodes > and graph edges, with a uA to indicate whether it's an edge or a node. > This allows for extremely rich (i.e. a whole subtree if you want) > attributing of edges. So for example you could store history for the > edge's attributes in subnodes of the leo-node representing the edge. > > Or you can do what backlinks.py does and store all the edge information > in uAs, so the edge isn't any first class leo data structure. Pickling > (or otherwise storing) nested dictionaries lets you do anything you want > really. There are many possible ways of adding information to nodes. The essential advantage of the one-node scheme is that, for the first time ever, there is a clear and direct mapping from internal nodes (vnode) to modeled nodes. The end of the endless confusion between about what (internal) nodes are and aren't duplicated will have many benefits, some of which we will not foresee. Edward --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
