@algorithm.ts/bipartite-graph-matching
The algorithm to find the maximum matching of the bipartite graph.
- Latest release
- Aug 27, 2022
- Releases
- 18
- Known CVEs
- 0
- First release
- Feb 06, 2022
- License
- MIT
Repository
Source
- Stars
- —
- Forks
- —
- Open issues
- —
Security score
No OpenSSF Scorecard available for this repository.
Packages from this repo
-
@algorithm.ts/base64
-
@algorithm.ts/bellman-ford
-
@algorithm.ts/binary-index-tree
-
@algorithm.ts/binary-search
-
@algorithm.ts/bipartite-matching
-
@algorithm.ts/calculate
-
@algorithm.ts/calculator
-
@algorithm.ts/circular-queue
-
@algorithm.ts/constant
-
@algorithm.ts/diff
-
@algorithm.ts/dijkstra
-
@algorithm.ts/dijkstra-bigint
Insights
Activity
- Total releases
- 18
- Last 12 months
- 0
- Cadence
- ~2 days
- Dependencies
- 0
Releases per month
last 12 monthsRelease mix
- patch 14
- pre 3
18
releases
Releases
| Version | Released | |
|---|---|---|
2.0.14
patch
| ||
2.0.13
patch
| ||
2.0.12
patch
| ||
2.0.11
patch
| ||
2.0.10
patch
| ||
2.0.9
patch
| ||
2.0.8
patch
| ||
2.0.8-alpha.0
pre
| ||
2.0.7
patch
| ||
2.0.7-alpha.1
pre
| ||
2.0.7-alpha.0
pre
| ||
2.0.6
patch
| ||
2.0.5
patch
| ||
2.0.4
patch
| ||
2.0.3
patch
| ||
2.0.2
patch
| ||
2.0.1
patch
| ||
2.0.0
initial
|