  We consider the class of directed graphs with $N$ edges and without loops
shorter than k. Using the concept of a labelled graph, we determine graphs from
this class that maximize the number of all paths of length k.Then we show an
R-labelled version of this result for semirings R contained in the semiring of
non-negative real numbers and containing the semiring of non-negative rational
numbers.
