#topological

topologic

Topological sorting of Acyclic Dependency Graphs

3 releases (stable)

1.1.0 Jan 23, 2024
1.0.0 Jul 12, 2023
0.1.0 Jul 12, 2023

#935 in Algorithms

Download history 4/week @ 2024-06-24 2/week @ 2024-07-01 37/week @ 2024-07-08 24/week @ 2024-07-15 34/week @ 2024-07-29 29/week @ 2024-08-05 23/week @ 2024-08-12 19/week @ 2024-08-26 1/week @ 2024-09-02 20/week @ 2024-09-16 25/week @ 2024-09-23 17/week @ 2024-09-30

62 downloads per month
Used in 5 crates (4 directly)

MIT license

16KB
247 lines

topologic

This module provides a structure for representing and manipulating acyclic dependency graphs. Usage is generally to build a graph of dependencies by adding direct dependency pairs and then querying the graph for properties such as:

  • total dependencies of a certain node
  • total dependents of a certain node
  • topological sorting of dependencies
  • topological sorting of dependents

Usage

Please see the unit tests in lib.rs for examples of usage.

Todo:

  • Change topographical sort to use flags instead of memory allocation to avoid cloning the graph.

No runtime deps