Skip to content

C++ code accompanying the paper "A Dynamic Topological Sort Algorithm for Directed Acyclic Graphs".

License

Notifications You must be signed in to change notification settings

DavePearce/DynamicTopologicalSort

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 

Repository files navigation

DynamicTopologicalSort

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).

About

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.

About

C++ code accompanying the paper "A Dynamic Topological Sort Algorithm for Directed Acyclic Graphs".

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published