C(1,1): The letter T at C(1,1) implies that there should be Ts on the diagonal of A.
C(3,3): One round of the Warshall algorithm only seems to find reachable nodes at a depth of two. Since it takes three edges to reach node number three from itself, one round is not enough.