On Mon, 14 Apr 2008 08:09:00 -0500
"Edward K. Ream" <[EMAIL PROTECTED]> wrote:
> 6. It looks like the new code will work unchanged in both the DAG and
> graph worlds.
This is great. I was never really a fan of the previous great graph
aha that graphs could be represented in trees, anything can be
represented in trees, or strings, or base64, after all. But now more
complex relationships can actually be integrated in Leo so much more
tightly.
So the (non-urgent) issue I see is how could cyclic graphs be included
in a Leo outline that was mostly DAG, in some way that Leo knows that
from this node and beyond cycles may occur. E.g. E in this example:
|
| B
A+---+
| |
| C+----
| |
| D+----
|
| F G
E+---+------+
| |
| |
H+------+I
Maybe the idea of isolating the cyclic parts isn't good though, it
devolves back to the original graph aha. Let's just see how it
evolves, I'm sure with children and parent lists everything is
possible.
Cheers -Terry
--~--~---------~--~----~------------~-------~--~----~
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
-~----------~----~----~----~------~----~------~--~---
