Our aim in this note is to prove a conjecture of Bondy, extending a cl
assical theorem of Dirac to edge-weighted digraphs: if every vertex ha
s out-weight at least 1 then the digraph contains a path of weight at
least 1. We also give several related conjectures and results concerni
ng heavy cycles in edge-weighted digraphs. (C) 1996 Academic Press, In
c.