are all transitive reductions of a graph isomorphic?

Question

Transitive reduction of a graph is not unique. Take this example:

Now if we remove the labels, the two reduced graphs are isomorphic:

are all transitive reductions of a directed graph isomorphic ? (I'm interested in weakly connected digraphs by the way)