Search results

49 packages found

Topological sorting with grouping support

published version 6.0.2, 2 years ago60 dependents licensed under $BSD-3-Clause
61,135,044

Topological sort of directed ascyclic graphs (like dependecy lists)

published version 2.0.2, 7 years ago546 dependents licensed under $MIT
36,144,683

Topological sort of directed acyclic graphs (like dependecy lists)

published version 1.0.1, 10 years ago200 dependents licensed under $MIT
8,677,858

Topological sort on directed graphs.

published version 0.0.1, 12 years ago85 dependents licensed under $MIT
2,271,347

Merge two lists, trying to preserve the order of both

published version 1.0.1, 9 years ago18 dependents licensed under $MIT
1,025,917

Topological sort

published version 0.3.0, 7 years ago18 dependents licensed under $MIT
253,934

Directed graphs analyzer for parallel traversals

published version 1.2.0, 2 years ago3 dependents licensed under $MIT
74,636

Run async tasks with dependencies

published version 1.0.3, 6 years ago6 dependents licensed under $MIT
63,993

Sort items in a graph using a topological sort while resolving cycles with priority groups

published version 2.0.0, 8 years ago7 dependents licensed under $MIT
10,174

Sort items in a graph using a topological sort while resolving cycles with priority groups

published version 1.1.1, 2 years ago1 dependents licensed under $MIT
11,164

A tiny dependency solver using topological sorting

published version 1.0.6, 8 years ago6 dependents licensed under $MIT
4,532

Simple and fast implementation of topological sorting. No dependencies. A circular graph will throw an error with circular nodes info.

published version 1.0.0, 11 years ago11 dependents licensed under $MIT
10,583

Directed Graph

published version 2.0.4, 2 months ago1 dependents licensed under $MIT
8,629

Run operations on a graph, maximizing parallelism

published version 1.1.0, 2 months ago3 dependents licensed under $BlueOak-1.0.0
3,227

A tiny (~400B) utility that executes a dependency graph of async functions as concurrently as possible.

published version 2.0.0, a year ago1 dependents licensed under $Apache-2.0
3,140

Topological sort of directed ascyclic graphs (like dependecy lists)

published version 2.1.2, a year ago0 dependents licensed under $MIT
2,024

Topological sorting and cycle detection. Optional grouping for parallel processing

published version 2.0.3, 13 days ago1 dependents licensed under $MIT
2,299

toposort with objects

published version 1.0.1, 10 years ago1 dependents
924

Simple and fast implementation of topological sorting. No dependencies. A circular graph will throw an error with circular nodes info.

published version 1.0.1, 6 years ago1 dependents licensed under $MIT
524

Undirected Graph

published version 2.0.4, 2 months ago0 dependents licensed under $MIT
683