Hello everybody, i have a non directed graph with weighted edges and i'm having trouble trying to solve the following problem :
A man starts in a city (e.g. A), he goes to city (e.g. H), passing through some mandatory cities (e.g. D and F).
I need to find the path with minimum cost (the man can revisit the same city if necessary).
Well the solution needs to work up to 10000 intermediary cities. I already tried with dijkstra but always picking the closest next city doesn't give me the optimal solution, only brute force works (with a small number of cities).
Last edited by motarules; April 7th, 2009 at 07:14 AM.