  In this note we give sufficient conditions for the convergence of the
iterative algorithm called weighted-average consensus in directed graphs. We
study the discrete-time form of this algorithm. We use standard techniques from
matrix theory to prove the main result. As a particular case one can obtain
well-known results for non-weighted average consensus. We also give a corollary
for undirected graphs.
