June 23rd, 2013, 11:57 AM
I've read a little about finding the longest path in undirected graph, but haven't found any solutions to that problem. So let's assume we have undirected, unweighted graph - how do we determine the longest possible path, where each node can be visited only once?
As far as I understood, this is NP-complete problem, but do you guys know the algorithm to solve it?
Tags for this Thread
Click Here to Expand Forum to Full Width
This is a CodeGuru survey question.