Find the shortest path through a graph in efficient time, with the additional constraint that the path must contain exactly n nodes.