Re: overall-longest-possible-path problem

I think what you are looking for is an algorithm for constructing the longest eulerian path in a graph.
Fleury's algorithm might be related. It constructs an eulerian cycle if that is possible. Perhaps it constructs the longest eulerian path starting from a given node?

Alexander Landa wrote: 
Hi,

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 would be very glad, if You can refer to some information for solving this problem.

Thanks for help! 
.