Suppose I have a graph with n nodes and the starting point is given.
How can I find out the shortest path that passes through exactly m different nodes (each node can
