  In this article, we study the strongly robust property of toric ideals of
weighted oriented graphs. Let $D$ be a weighted oriented graph consists of
weighted oriented cycles (balanced or unbalanced) sharing a single vertex $v$
and $D^{\prime}$ be a weighted oriented graph consists of $D$ and a finite
number of disjoint cycles such that each of these cycles is connected by a path
at the sharing vertex $v$ of $D$. Then we show that the toric ideals
$I_D,I_{D^{\prime}}$ of $D$ and $D^{\prime}$ respectively, are strongly robust
and hence robust. That is, for the toric ideal $I_D$, of $D$, its Graver basis
is a minimal generating set of $I_D$. We explicitly give a unique minimal
generating set of primitive binomials of $I_D$. We explicitly describe the
circuit binomials in any weighted oriented graph.
