Re: Finding longest path between two vertices

On Tue, 19 Jun 2007 00:15:52 +0200, <tchow@xxxxxxxxxxxxx> wrote:

On Jun 18, 3:36 pm, Jym <Jean-Yves.Moyen+n...@xxxxxxxxxxxx> wrote:
I agree that there is a problem for finding "longest simple path" (ie
without taking the same edge several times). The OP had not make it clear
if that's really what he meant by "longest path".

O.K., you could be right. However, usually "path" means that there are no
repeated vertices. "Hamiltonian path," "shortest path," etc., all mean no
repeated vertices in the literature. But, it's conceivable that the OP
meant to consider only acyclic directed graphs.

OK, my bad then.

I'm currently working with graphs and considering all paths and cycles and not only simple ones, hence making the distinction explicit whenever I need it. That probably has mislead me :-(

Thanks for the clarifications.
--
Hypocoristiquement,
Jym.
.