# How to find the path of the maximal distance between two vertices on a complete digraph?

I was wondering how can I find the path of the maximal distance between two vertices on a complete digraph. Suppose the digraph has 5 vertices:

`sage: g = graphs.CompleteGraph(5).to_directed()`

I have seen a maximal flow example which is nice but it is not the same type of problem. How can I use sage to find the longest path?

In general, I would also like to find if the complete digraph has n vertices, how can I find the path(s) from any two vertices of distance (n-1), (n-2), ..., 2?