Re: Finding longest path between two vertices

Tim Frink schrieb:
> Do you see any problems with my suggestion of negating
> the edge weights and than search the shortest path?

It's not you, who will assign edge weights to the
original graph, it's the user of your algorithm.
To get a Hamiltonian path, he'll set all edges
to the same value, e.g. 1.

Regards,
Joachim
.