OJ Board

Someone sent me some offline messages to know about Shorir's algo. Unfortunately, i deleted his/her name accidentally from my list . Can (s)he plz send his/her add again so that i can mail him/her?
Thanx!

At last I got it AC :)
What i did is check that:
1. The indegree is equal to the out degree for each vertex
2. There is no forward or cross edge in the dfs tree of the graph
3. There is at most one back edge pointing to any particular vertex in the dfs tree.
By the way, i checked strong ...

Is finding cactus related to finding articulation points in a directed graph anyway? i think in a cactus, the simple cycles are connected to each other only through articulation vertices. i tried in this way, but still WA
Can anybody tell me the correct approach to solving this problem?