OJ Board

Hi there,

I think that algorithm Kuhn-Munkres is really good. Its time complexity is just O(n^3).

You can take a look at this site:
http://www.mc.edu/campus/users/travis/s ... notes.html

Regards

Let G be a graph, find the kth-shortest path from vertex x to vertex y.
Please show me the best algorithm.

Regards,
Babe

Thank Guest, I think you're right.
But, is there any greedy method?

Regards,
Babe

I have a problem: let G be a graph, G may have circuit, find the longest path in G which go through each vertex at most 1 time and if:
a/ G is directed
b/ G is undirected
Please give me your idea whether a good algorithm exists or not.

Regards,
Babe