Find the transitive closure of the directed graph.
The directed graph is given with the list of edges. The first line contains the number of vertices . Each of the next lines contains two vertices and describing the directed edge from to .
Print the adjacency matrix of the transitive closure of the directed graph.