Hi Chris,
I'm not quite understanding the type that is sent to the transitive closure
example code in 6.12. It doesn't appear to be an Adjacency List or Matrix.
The text says that it uses a series of tuples for representation, but I don't
quite follow what that means in terms of the example of:
That means that the graph is a matrix of boolean variables. If GT.I.J is
true, J is a successor of I (i.e., there is an edge going from I to J).
Notice that this is explained in page 468 (just before the section
"Second declarative algorithm").
[1#[2 3] 2#[2
3] 3#nil]
your input should be something like:
graph(sucs(false true true) sucs(false true true) sucs(false false false))
{InG.I.K andthen InG.K.J}
You got a typo here. You should write:
(InG.I.K andthen InG.K.J)
Luis
_________________________________________________________________________________
mozart-users mailing list
[email protected]
http://www.mozart-oz.org/mailman/listinfo/mozart-users
