0

Given a graph structure that has asymmetric costs on the edges, is there a way to traverse a certain set of nodes at lowest cost if you can visit each node only once? Problem is formulated such that such a path must exist.

Aditya
  • 5,509
  • 4
  • 31
  • 51
amatsukawa
  • 841
  • 2
  • 10
  • 21

2 Answers2

0

Brute-force will eventually solve the problem.

Casey Robinson
  • 1,021
  • 9
  • 17
0

I would use the A* algorithm.

kol
  • 27,881
  • 12
  • 83
  • 120
  • I attempted a USC algorithm, but it turned out to be almost equivalent to BFS (edge costs are large). I don't have a good guess for an admissible heuristic. Are there any sub-optimal solutions that find a 'pretty good' solution? – amatsukawa Nov 13 '11 at 21:56
  • The zero heuristic is admissible :) USC = ? – kol Nov 13 '11 at 23:01
  • USC = uniform cost search. A* degenerates into USC with zero heuristic. – amatsukawa Nov 13 '11 at 23:14
  • Why don't you use USC? You want something more effective? – kol Nov 13 '11 at 23:22
  • Yes, USC is slower than a greedy brute force algorithm. I was just wondering of there was something more effective. – amatsukawa Nov 14 '11 at 17:20