How to find a shortest cycle in a directed graph?
Posted: Sun Nov 13, 2005 8:41 am
As title. I just solve 10806, which is a problem of finding a shortest cycle in a bi-directional graph. I would like to ask if Dijkstra + Bellman-Ford can also find the shortest cycle in directed graph.
Thank you!
Thank you!