search for: diagrammat

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

...that the two must be separated. It may be that adding any annotation to a graph or diagram will interfere with the "intuitive" imterpretation that the diagram is intended to stimulate, with no associated benefit. It may be that presenting numerical/textual information within a graphical/diagrammatic context will interfere with the "analytic" interpretation wich is desired, with no associated benefit. In such cases, it is clearly (and as a matter of fact to be decided in each case) better to separate the two apsects. It may, however, be that both can be combined in such a way that...