How to detect a cycle in a directed graph using the union-find algorithm

Question

Can I apply the union-find algorithm for the detecting a cycle in a directed graph other than Depth First Search (DFS)?

I know that we can apply the union-find algorithm for the detecting cycle in a undirected graph.