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
