thanks - I will take a look On Tue, Apr 14, 2009 at 1:27 PM, R.E. Boss <[email protected]> wrote:
> This http://www.jsoftware.com/pipermail/programming/2007-July/007283.html > determines components, if I remember correctly. > > > R.E.Boss > > > > -----Oorspronkelijk bericht----- > > Van: [email protected] [mailto:programming- > > [email protected]] Namens John Baker > > Verzonden: dinsdag 14 april 2009 16:44 > > Aan: [email protected] > > Onderwerp: [Jprogramming] quick test for rooted tree from parent/child > > connection table. > > > > I'm sure someone has worked through this. I am looking for a quick > > efficient J test that a parent child table digraph representation is > > a connected rooted tree. The node lists I am processing are in the many > > thousands so converting to an adjaceny matrix representation and using > > something like transitive closure is out. > > > > -- > > John D. Baker > > [email protected] > > ---------------------------------------------------------------------- > > For information about J forums see http://www.jsoftware.com/forums.htm > > ---------------------------------------------------------------------- > For information about J forums see http://www.jsoftware.com/forums.htm > -- John D. Baker [email protected] ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
