Longest cycle in a digraph
The problem of finding a longest simple cycle in a digraph is NP-hard, since the problem of finding a longest simple cycle in an undirected graph is a special case: you can consider an undirected graph to be a digraph with a symmetric edge relation.  (Longest simple cycle is NP-hard since it lets you solve Hamiltonian cycle.)