npmjs.org : graph-sort
DAG-based sorting algorithm minimizing the number of comparison required to find top N items from a list without absolute value
Registry
-
Source
- Homepage
- JSON
- codemeta.json
purl: pkg:npm/graph-sort
Keywords:
sorting
, graph
, manual
, compare
, efficient
, dag
, tree
, native
, algorithm
, top-n
, candidate
, relative sorting
, relative comparison
License: BSD-2-Clause
Latest release: over 1 year ago
First release: almost 5 years ago
Dependent packages: 1
Downloads: 33 last month
Stars: 0 on GitHub
Forks: 0 on GitHub
See more repository details: repos.ecosyste.ms
Last synced: about 8 hours ago