Skip to content

An implementation of the Pearce-Kelly dynamic topological sorting algorithm for directed acyclic graphs (DAG).

License

Notifications You must be signed in to change notification settings

metapragma/pearce-kelly

Repository files navigation

pearce-kelly

An implementation of the Pearce-Kelly dynamic topological sorting algorithm for directed acyclic graphs (DAG). The canonical application of topological sorting is in scheduling a sequence of jobs or tasks based on their dependencies.

Features

  • Fast tracking (performing more activities in parallel)
  • Cycle detection
  • Dynamic edge insertions and deletions

References

About

An implementation of the Pearce-Kelly dynamic topological sorting algorithm for directed acyclic graphs (DAG).

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published