Re: Finding longest path between two vertices

In article <op.tt43c3thft6h9m@xrousse>,
Jym <Jean-Yves.Moyen+news@xxxxxxxxxxxx> wrote:
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 :-(

Commonly (though not universally), if repeated vertices but not repeated
edges are allowed, the term is a "trail." If repeated edges are also
allowed then the term is a "walk." If the trail or walk ends where it
started then it is "closed."
--
Tim Chow tchow-at-alum-dot-mit-dot-edu
The range of our projectiles---even ... the artillery---however great, will
never exceed four of those miles of which as many thousand separate us from
the center of the earth. ---Galileo, Dialogues Concerning Two New Sciences
.