npmjs.org : @algorithm.ts/bipartite-graph-matching
The algorithm to find the maximum matching of the bipartite graph.
Registry
-
Source
- Homepage
- JSON
purl: pkg:npm/%40algorithm.ts/bipartite-graph-matching
Keywords:
algorithm
, bipartite-graph-matching
, bipartite-graph-matching + priority-queue
, shortest path
, single source shortest path
License: MIT
Latest release: almost 3 years ago
First release: over 3 years ago
Namespace: algorithm.ts
Dependent packages: 2
Downloads: 29 last month
Stars: 106 on GitHub
Forks: 10 on GitHub
Total Commits: 441
Committers: 1
Average commits per author: 441.0
Development Distribution Score (DDS): 0.0
More commit stats: commits.ecosyste.ms
See more repository details: repos.ecosyste.ms
Last synced: 8 days ago