[Novalug] [OT] programming question PERL for PERL GURU

Jay Berkenbilt ejb@ql.org
Fri May 29 18:12:35 EDT 2009


Jay Berkenbilt <ejb@ql.org> wrote:

> Yes, this is exactly a topological sort.  If you're not up on your
> graph theory [:-)], a graph is a collection of nodes (the dogs) with
> edges between them.  A directed graph is a graph in which the edges
> point from one node to another and not necessarily back.  In your
> case, there is an edge between two nodes if one is the parent of the
> other.  A directed acyclic graph is a directed graph that contains no
> cycles; i.e., no dog is going to be a parent of one of its
> descendents!

I meant to say "a child of one of its descendents".....

--Jay



More information about the Novalug mailing list