How to find the minimum (or close to minimum) cost path that visits a subset of nodes within a graph? What algorithms can I use?
I googled and found: http://lcm.csa.iisc.ernet.in/dsa/node181.html
But the problem doesn't look like a minimum-cost spanning trees.
This is because the subset of nodes that I want to visit is not all of the nodes in a graph.
Sometimes there is no direct path between a node that I want to visit with any other nodes that I want to visit.
This means creating a subgraph that contains only the nodes I want to visit won't help because I definitely have to go through some of the nodes that I dont want to visit.