  We define an on-line (incremental) algorithm that, given a (possibly
infinite) pseudo-transitive oriented graph, produces a transitive
reorientation. This implies that a theorem of Ghouila-Houri is provable in
RCA_0 and hence is computably true.
