Re: Transitive Closure

"x" <x-false_at_yahoo.com> wrote in message news:<40a9b150_at_post.usenet.com>...
> "Mikito Harakiri" <mikharakiri_nospaum_at_yahoo.com> wrote in message
> news:8a529bb.0405171536.3b063d3f_at_posting.google.com...
> > Edges:
> >
> > tail head
> > ---- ----
> > 1 2
> > 2 3
> >
> > Adjacency Matrix:
> >
> > mapple> G:=Matrix(3,3,[[0,0,0],[1,0,0],[0,1,0]]);
> >
> > Transitive Closure:
> >
> > mapple> (1-G)^(-1);
> >
> > MATRIX([[1, 0, 0], [1, 1, 0], [1, 1, 1]])
> >
> > mapple> exponential(G);
> >
> > MATRIX([[1/2, 0, 0], [1, 1, 0], [1, 1, 1]])
>
> >>> Elements of TC(A),
> >>> on the other hand, should be allowed at least Real. TC(A) is interpreted
> >>> back to graph the following way: if matrix component value is non 0 then
> >>> nodes are adjacent.
>
> Interpreted back to graph, I see that the results are the same. :-)
> So what do you mean by correct ?

I mean that this ambiguity is not satisfactory. It would be nice to conclude, for example, "Transitive closure is exponentiation operator". Received on Thu May 20 2004 - 20:47:21 CEST