Simple implementation for detecting cycles in a directed graph in C?

Run a DFS on G and check for backedges. At every node you expand just check if it is already in the currrent path.

Check out QuickGraph - it has loads of the algorithms implemented and it's quite a nice library to use.

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.