This repository contains C++ code accompanying the folowing paper:
- A Dynamic Topological Sort Algorithm for Directed Acyclic Graphs, David J. Pearce and Paul H.J. Keylly. ACM Journal of Experimental Algorithmics (JEA), volume 11, pages 1.7, 2007. DOI (you can find a preprint on my homepage as well).
The dynamic topological sort problem is that of updating the topological sort of a directed graph after one or more edges are inserted. The objective of algorithms in this space is to reduce the amount of work done as much as possible.