How can I find the shortest cycle in a Directed, Weighted Graph?

问题

I am looking for the easiest way to find the shortest cycle in a graph.

回答1:

"By the power of Google!" - Heman

You can find it here http://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm

来源：https://stackoverflow.com/questions/5700148/how-can-i-find-the-shortest-cycle-in-a-directed-weighted-graph