1 problem

Let $D$ be a semicomplete digraph, and let $x,y$ be distinct vertices of $D$. A longest $(x,y)$-path is an $(x,y)$-path containing the maximum possible number of arcs. Longest path…