Find path of shortest cycle in a directed Graph.

Given a start node and directed graph (2-D array), you need to find the path of the shortest cycle which starts from the given start node. Path can be returned as an arraylist of integers.

How this question can be solved??