An algorithm which enumerates all oriented walks of the length $k$ $(k\in N)$ in any digraph (or graph) with the initial and final vertices in the given sets of vertices is presented. It is shown that the recurrence relation for these numbers is obtainable.