  In this work, we establish an analogue result of the Erd\"os-Stone theorem of
weighted digraphs using Regularity Lemma of digraphs. We give a stability
result of oriented graphs and digraphs with forbidden blow-up transitive
triangle and show that almost all oriented graphs and almost all digraphs with
forbidden blow-up transitive triangle are almost bipartite respectively.
