A dynamic topological sort algorithm for directed acyclic graphs
暂无分享,去创建一个
We consider the problem of maintaining the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, although this has in...