On Sun, Jul 5, 2009 at 5:36 PM, Edward K. Ream<[email protected]> wrote:
> Actually, in a dag, it is possible to determine v's descendants, but it's > probably not possible to determine v's descendants in a general graph > without knowing which links have already been followed. Surely you're staying with DAG, so listing descendants is a trivial operation... We already talked about the general graph route and it won't work, such functionality is best reserved for backlinks.py and the likes. -- Ville M. Vainio http://tinyurl.com/vainio --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
