|
1 | | -:cherry_blossom: [@aureooms/js-maximum-matching](https://make-github-pseudonymous-again.github.io/js-maximum-matching) |
| 1 | +:cherry_blossom: [@graph-algorithm/maximum-matching](https://graph-algorithm.github.io/maximum-matching) |
2 | 2 | == |
3 | 3 |
|
4 | 4 | Maximum matching algorithms for JavaScript. |
5 | | -Parent is [@aureooms/js-gn](https://github.com/make-github-pseudonymous-again/js-gn). |
6 | | -See [docs](https://make-github-pseudonymous-again.github.io/js-maximum-matching/index.html). |
| 5 | +Parent is [js-algorithms](https://github.com/make-github-pseudonymous-again/js-algorithms). |
| 6 | +See [docs](https://graph-algorithm.github.io/maximum-matching/index.html). |
7 | 7 |
|
8 | 8 | ```js |
9 | | -import maximumMatching, {iter} from '@aureooms/js-maximum-matching'; |
| 9 | +import maximumMatching, {iter} from '@graph-algorithm/maximum-matching'; |
10 | 10 | const edges = [[1, 2, 10], [2, 3, 11]] ; |
11 | 11 | const matching = maximumMatching(edges) ; // [-1, -1, 3, 2] |
12 | 12 | [...iter(matching)]; // [ [2, 3] ] |
13 | 13 |
|
14 | | -import maximumCardinalityMatching from '@aureooms/js-maximum-matching/cardinality'; |
| 14 | +import maximumCardinalityMatching from '@graph-algorithm/maximum-matching/cardinality'; |
15 | 15 | for (const edge of iter(maximumCardinalityMatching([[1, 2], [2, 3], [3, 4]]))) { |
16 | 16 | console.log(edge); |
17 | 17 | } |
18 | 18 | // [1,2] |
19 | 19 | // [3,4] |
20 | 20 | ``` |
21 | 21 |
|
22 | | -[](https://raw.githubusercontent.com/make-github-pseudonymous-again/js-maximum-matching/main/LICENSE) |
23 | | -[](https://www.npmjs.org/package/@aureooms/js-maximum-matching) |
24 | | -[](https://github.com/make-github-pseudonymous-again/js-maximum-matching/actions/workflows/ci:test.yml?query=branch:main) |
25 | | -[](https://david-dm.org/make-github-pseudonymous-again/js-maximum-matching) |
26 | | -[](https://david-dm.org/make-github-pseudonymous-again/js-maximum-matching?type=dev) |
27 | | -[](https://github.com/make-github-pseudonymous-again/js-maximum-matching/issues) |
28 | | -[](https://www.npmjs.org/package/@aureooms/js-maximum-matching) |
29 | | - |
30 | | -[](https://codeclimate.com/github/make-github-pseudonymous-again/js-maximum-matching/issues) |
31 | | -[](https://codeclimate.com/github/make-github-pseudonymous-again/js-maximum-matching/trends/churn) |
32 | | -[](https://codecov.io/gh/make-github-pseudonymous-again/js-maximum-matching) |
33 | | -[](https://codeclimate.com/github/make-github-pseudonymous-again/js-maximum-matching/trends/technical_debt) |
34 | | -[](https://make-github-pseudonymous-again.github.io/js-maximum-matching/source.html) |
35 | | -[](https://bundlephobia.com/result?p=@aureooms/js-maximum-matching) |
| 22 | +[](https://raw.githubusercontent.com/graph-algorithm/maximum-matching/main/LICENSE) |
| 23 | +[](https://www.npmjs.org/package/@graph-algorithm/maximum-matching) |
| 24 | +[](https://github.com/graph-algorithm/maximum-matching/actions/workflows/ci:test.yml?query=branch:main) |
| 25 | +[](https://david-dm.org/graph-algorithm/maximum-matching) |
| 26 | +[](https://david-dm.org/graph-algorithm/maximum-matching?type=dev) |
| 27 | +[](https://github.com/graph-algorithm/maximum-matching/issues) |
| 28 | +[](https://www.npmjs.org/package/@graph-algorithm/maximum-matching) |
| 29 | + |
| 30 | +[](https://codeclimate.com/github/graph-algorithm/maximum-matching/issues) |
| 31 | +[](https://codeclimate.com/github/graph-algorithm/maximum-matching/trends/churn) |
| 32 | +[](https://codecov.io/gh/graph-algorithm/maximum-matching) |
| 33 | +[](https://codeclimate.com/github/graph-algorithm/maximum-matching/trends/technical_debt) |
| 34 | +[](https://graph-algorithm.github.io/maximum-matching/source.html) |
| 35 | +[](https://bundlephobia.com/result?p=@graph-algorithm/maximum-matching) |
36 | 36 |
|
37 | 37 | ## :clap: Credits |
38 | 38 |
|
|
0 commit comments