# Discrete Math: Warshall's Algorithm

Please see the attached file for the fully formatted problems.

Let A = {a, b, c, d} and let the relation R be defined on A by the matrix

MR = Note, take the nodes in A in the order given

Use Warshall's Algorithm to determine the transitive closure of R.

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?

Â© BrainMass Inc. brainmass.com March 4, 2021, 5:42 pm ad1c9bdddfhttps://brainmass.com/math/discrete-math/discrete-math-warshall-algorithm-7067

#### Solution Summary

Transitive closure is determined using Warshall's Algorithm. The solution is detailed and well presented.

$2.19