Give an algorithm that takes as input a directed graph with positive edge lengths, and returns the length of the shortest cycle in the graph

Question

Give an algorithm that takes as input a directed graph with positive edge lengths, and returns the length of the shortest cycle in the graph (if the graph is acyclic, it should say so). Your algorithm should take time at most O(n*m*log(n)), where n is the number of vertices and m is the number of edges.

Answer 1

I think you can solve this by modifying the Dykstra's shortest path algorithm. Please google it up. It is a recursive algorithm.