I have a graph fully connected whose vertices represents points in a city. On each edge I also have information on the distance between two points and an estimation of the time needed to go from a point to another. Now I'm wondering if there's an efficient way to get the biggest cycle given a starting point and a time limit. In other words, given a max time limit, I want to maximize the number of points in a cycle.
The only solution I found is something like a "brute force" algorithm which try each node until find a suitable solution, but it's horribly slow.