Algorithm of bidirectional graph?

I would use breadth first search starting with the node set E . V will then be the last node you visit.

If the graph is acyclic you can make the edge weights -1 and run Floyd-Warshall. This will give you all-pairs longest path. Then for each node in the graph take the average distance to the nodes in E.

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.