A directed path is a path in a directed graph whose edges are all traversed from tail to head; if we think of directed edges as "one-way streets," then a directed path is simply a path that follows all the streets in the legal direction.
For example, a directed path of length 2 can be found by following from node 7 to node 11 and then to node 10.
