On Sun, Aug 1, 2010 at 9:32 AM, thyrsus <[email protected]> wrote: > I think a lot of Leo's power comes from its ability to represent DAGs, > so my interest is piqued when someone discusses graphs for problem > solving. I haven't digested it yet, but this presentation is > fascinating: Problem Solving using Graph Traversals > > http://www.slideshare.net/slidarko/problemsolving-using-graph-traversals-searching-scoring-ranking-and-recommendation
Many thanks for this link. There are a lot of resources there. It's looks like it would repay much more study than I have given it :-) I suspect that the ideas in this paper are too general to apply directly to Leo's innards or design. Presumably, though, one might represent programs in the TinkerPop set of tools in Leo's nodes, just as Leo can already represent general graphs using the networkx tool. But these are just my off-the-cuff first impressions. It may be that I have missed something truly spectacular in all the tensors, index-free data, etc. That is, I want to encourage us all to mine the slides, and the products and ideas behind them, for nifty ideas. Edward ------------------------------------------------------------------------------ Edward K. Ream email: [email protected] Leo: http://webpages.charter.net/edreamleo/front.html ------------------------------------------------------------------------------ -- 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.
