Re: overall-longest-possible-path problem

that is correct, i mistakenly used the word path above... although, more common (as far as ive seen) than "trail" is "walk" ... so you might also search for "longest walk"

tchow@xxxxxxxxxxxxx wrote: 
In article <d4ausi$nsi$1@xxxxxxxxxxxx>, Alexander Landa  <sorry@xxxxxxx> wrote:

i'm looking for some research papers and algorithms for solving
"overall-longest-possible path" problem, that is finding lonegst
path between all pairs of nodes in graph (not digraph!) which can
contain cycles (multiple vertices but only singe edges) in solution.



I can't help much, unfortunately, except to suggest that what you're looking
for is often called a "longest trail" rather than a "longest path."

Of course, as someone else mentioned, if you can hit *every* edge then
you have an "Eulerian trail," about which there is much literature,
but I don't know how you would maximize the length of a trail if there
is no Eulerian trail.

.