How to find a direct transitive closure?

[Vanilla95]

Please explain to me how to find a direct transitive closure for x2 on this adjacency matrix?

$\displaystyle \begin{array}{c|c|c|c|c|c|c|} &x_1&x_2&x_3&x_4&x_5&x_6 \\ \hline x_1&0&1&1&0&0&0 \\ \hline x_2&0&1&0&0&1&0 \\ \hline x_3&0&0&0&0&0&0 \\ \hline x_4&0&0&1&0&0&0 \\ \hline x_5&1&0&0&1&0&0 \\ \hline x_6&1&0&0&0&1&1 \\ \hline \end{array}$ . . . . . $\displaystyle \begin{array}{|c|}T\, +\, x2 \\ \hline ? \\ \hline ? \\ \hline ? \\ \hline ? \\ \hline ? \\ \hline ? \\ \hline \end{array}$

I don't understand.

 

[stapel]

Please explain to me how to find a direct transitive closure for x2 on this adjacency matrix?

$\displaystyle \begin{array}{c|c|c|c|c|c|c|} &x_1&x_2&x_3&x_4&x_5&x_6 \\ \hline x_1&0&1&1&0&0&0 \\ \hline x_2&0&1&0&0&1&0 \\ \hline x_3&0&0&0&0&0&0 \\ \hline x_4&0&0&1&0&0&0 \\ \hline x_5&1&0&0&1&0&0 \\ \hline x_6&1&0&0&0&1&1 \\ \hline \end{array}$ . . . . . $\displaystyle \begin{array}{|c|}T\, +\, x2 \\ \hline ? \\ \hline ? \\ \hline ? \\ \hline ? \\ \hline ? \\ \hline ? \\ \hline \end{array}$

I don't understand.

Which part(s) do you not understand? Has your class not covered this material yet? Are you stuck on applying an algorithm they've given you (such as page 14, etc, in this paper)? Are you saying that you think that definitions are missing (such as were requested of you here)?

When you reply, please include a clear listing of your thoughts and efforts so far. Thank you!