 In all of these transitive closure algorithms , it is possible to distinguish pairs of vertices that are reachable by at least one path of length two or more from pairs that can only be connected by a length @-@ one path . The transitive reduction consists of the edges that form length @-@ one paths that are the only paths connecting their <unk> . Therefore , the transitive reduction can be constructed in the same asymptotic time bounds as the transitive closure . 
