Modified shortest path using Dijkstra's or Bellman–Ford's algorithm?

If I understand this right, you want to change the cost of an edge in a graph depending on nodes which are visited in your current path. An example from the comments is.

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.