search for: diagrammatically

Aloha all, I have an adjacency matrix for an acyclic digraph that contains transitive relations, e.g. (u,v), (v,w), (u,w). I want a DAG with only intransitive relations. Can someone point me to an R function that will take my adjacency matrix and give me back one with only intransitive relations? In the example, I'd like to get rid of (u,w) and keep (u,v) and (v,w). All the best, Tom --

Skipped content of type multipart/alternative-------------- next part -------------- A non-text attachment was scrubbed... Name: not available Type: image/bmp Size: 2918 bytes Desc: Picture (Metafile) Url : http://lists.digium.com/pipermail/asterisk-users/attachments/20050307/cb404791/attachment.bmp

Greg, I'm going to join issue with your here! Not that I'll go near advocating "Excel-style" graphics (abominable, and the Patrick Burns URL which you cite is remarkable in its restraint). Also, I'm aware that this is potential flame-war territory -- again, I want to avoid that too. However, this is the second time you have intervened on this theme (previously Mon 6