What does it mean by "Path Matrix" and "Transitive Closure" of a graph (Directed and Undirected)?

I the discussion of various graph algorithms, I see the terms "Path Matrix" and "Transitive Closure" which are not well-defined anywhere.

What does it mean by "Path Matrix" and "Transitive Closure" in case of both Directed and Undirected graphs?