Let A = {a, b, c, d} and let the relation R be defined on A by the
matrix
Note, take the nodes in A in the order given.
(a) Use Warshall’s Algorithm to determine the transitive closure of R.
(b) Draw the digraph of the transitive closure of R and use the digraph
to explain the idea of connectivity. Is this graph connected? What does
this mean?
