(Ted Harding) writes:
> On 11-Jul-11 19:28:12, Thomas S. Dye wrote:
>> 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 th
Peter Langfelder writes:
> On Mon, Jul 11, 2011 at 12:28 PM, Thomas S. Dye wrote:
>> 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
On Jul 11, 2011, at 7:25 PM, Thomas S. Dye wrote:
David Winsemius writes:
On Jul 11, 2011, at 3:28 PM, Thomas S. Dye wrote:
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 relat
David Winsemius writes:
> On Jul 11, 2011, at 3:28 PM, Thomas S. Dye wrote:
>
>> 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
On Mon, Jul 11, 2011 at 12:28 PM, Thomas S. Dye wrote:
> 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 adj
On 11-Jul-11 19:28:12, Thomas S. Dye wrote:
> 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
> matr
On Jul 11, 2011, at 3:28 PM, Thomas S. Dye wrote:
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 m
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
8 matches
Mail list logo