Dynamic cycle Detection

Hello Everyone,
I am working on a problem in which I add edges to a DAG G one by one.
After each addition I need to check if the addition made the digraph
cyclic. I can check this by running DFS, but I want to do it more
efficiently by using the information already available.
Does anyone have any idea on how it can be done efficiently?
Thanks
Aimal

.