Graydon wrote:
[Directed and acyclic are orthogonal characteristics when applied to graphs. A graph may be either, neither, or both.]Sure.
Oh, and, just as an aside, I knew you knew that, but thought I'd include it for the PDML members who /aren't/ steeped in graph theory. ;->
-- Thanks, DougF (KG4LMZ) -- PDML Pentax-Discuss Mail List [email protected] http://pdml.net/mailman/listinfo/pdml_pdml.net to UNSUBSCRIBE from the PDML, please visit the link directly above and follow the directions.
