@algorithm.ts/bipartite-matching
The algorithm to find the maximum matching of the bipartite graph.
- Latest release
- Mar 23, 2026
- Releases
- 18
- Known CVEs
- 0
- First release
- Sep 12, 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-graph-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
- 1
- Cadence
- ~28 days
- Dependencies
- 1
Releases per month
last 12 monthsRelease mix
- major 1
- minor 1
- patch 6
- pre 9
18
releases
Dependencies
Depends on
4.0.5-
@algorithm.ts/queue
^4.0.5
Used by
Nothing tracked depends on this yet.
Releases
| Version | Released | |
|---|---|---|
4.0.5
patch
| ||
4.0.4
patch
| ||
4.0.3
patch
| ||
4.0.2
patch
| ||
4.0.1
patch
| ||
4.0.0
major
| ||
3.1.1
patch
| ||
3.1.0
minor
| ||
3.0.0
initial
| ||
3.0.0-alpha.8
pre
| ||
3.0.0-alpha.7
pre
| ||
3.0.0-alpha.6
pre
| ||
3.0.0-alpha.5
pre
| ||
3.0.0-alpha.4
pre
| ||
3.0.0-alpha.3
pre
| ||
3.0.0-alpha.2
pre
| ||
3.0.0-alpha.1
pre
| ||
3.0.0-alpha.0
pre
|