Suppose I have a directed graph with non-negative edge weights. In addition, each vertex is either "green" or "red". Assume that my source and destination vertices are red.
Given all of that, how do I find the shortest path with an odd number of green vertices?