Finding a path with minimum number of red vertices in a graph?

I think it is correct: essntially you are doing Dijkstra's algorithm with weights for red edges being very large, and weights for blue edges being very small or zero.

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.