http://blog.affien.com/archives/2007/07/02/online-cycle-detection-in-directed-graphs/ A few thoughts Sun, 31 May 2009 12:07:29 +0000 http://wordpress.org/?v=2.8 hourly 1 http://blog.affien.com/archives/2007/07/02/online-cycle-detection-in-directed-graphs/comment-page-1/#comment-149301 Ian Zimmerman Thu, 19 Jul 2007 18:14:05 +0000 http://blog.w-nz.com/archives/2007/07/02/online-cycle-detection-in-directed-graphs/#comment-149301 I think you got this from the same place as I did, and this was one more reason to not apply :-) Anyway, this seems to be still an active research topic; try to google for something like 'digraph incremental topological sort'. Note that it only makes sense to talk about complexity _per iteration_. There are indeed a few algorithms more efficient than the naive O (n+l) per iteration. I think you got this from the same place as I did, and this was one more reason to not apply Anyway, this seems to be still an active research topic; try to google for something like ‘digraph incremental topological sort’. Note that it only makes sense to talk about complexity _per iteration_. There are indeed a few algorithms more efficient than the naive O (n+l) per iteration.

]]>