On Fri, Dec 30, 2011 at 1:37 AM, Ville M. Vainio <[email protected]> wrote:
> Given the list of edges (a,b) : > > If you want all children of node N, list edges where N is the 'a' > node, and store the 'b' node from every edge. To find parent(s) of N, > list edges where N is the 'b' node. In C++ & SQL: https://gist.github.com/1536719 -- 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.
