Transpose graph

In the mathematical and algorithmic study of graph theory, the converse, transpose or reverse of a directed graph $G$ is another directed graph on the same set of vertices with all of the edges reversed compared to the orientation of the corresponding edges in $G$ . That is, if $G$ contains an edge $(u, v)$ then the converse/transpose/reverse of $G$ contains an edge $(v, u)$ and vice versa.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.