The question is "Use Warshall’s Algorithm to find the transitive closure of the relation {(a, c), (b, d), (c, a), (d, b), (e, d)} on the set {a, b, c, d, e}."
My matrix at the end is: ( 1 0 1 0 0 ) ( 0 1 0 1 0 ) ( 1 0 1 0 0 ) ( 0 1 0 1 0 ) ( 0 1 0 1 0 )
However, I did some code to do the Warshall's Algorithm and got the exact same output save for there being a 1 at (e,e). How do I get that?