{"_id":"@algorithm.ts/bipartite-graph-matching","_rev":"18-cac6bf0f42790504f10238def71df4e6","name":"@algorithm.ts/bipartite-graph-matching","dist-tags":{"latest":"2.0.14"},"versions":{"2.0.0":{"name":"@algorithm.ts/bipartite-graph-matching","version":"2.0.0","description":"Dancing link + Algorithm X","author":{"name":"guanghechen","url":"https://github.com/guanghechen/"},"repository":{"type":"git","url":"git+https://github.com/guanghechen/algorithm.ts.git","directory":"packages/bipartite-graph-matching"},"homepage":"https://github.com/guanghechen/algorithm.ts/tree/main/packages/bipartite-graph-matching#readme","keywords":["algorithm","bipartite-graph-matching","bipartite-graph-matching + priority-queue","shortest path","single source shortest path"],"main":"lib/cjs/index.js","module":"lib/esm/index.js","types":"lib/types/index.d.ts","source":"src/index.ts","license":"MIT","engines":{"node":">= 14.15.0"},"scripts":{"build":"cross-env NODE_ENV=production rollup -c ../../rollup.config.js","prebuild":"rimraf lib/ && tsc -p tsconfig.src.json --emitDeclarationOnly","prepublishOnly":"cross-env ROLLUP_SHOULD_SOURCEMAP=false yarn build","test":"cross-env TS_NODE_FILES=true jest --config ../../jest.config.js --rootDir ."},"gitHead":"832e998c72a5e2de64cdca52655e2f0456a17ba2","bugs":{"url":"https://github.com/guanghechen/algorithm.ts/issues"},"_id":"@algorithm.ts/bipartite-graph-matching@2.0.0","_nodeVersion":"14.17.1","_npmVersion":"lerna/4.0.0/node@v14.17.1+x64 (linux)","dist":{"integrity":"sha512-jW01LaNcKzBk8Bw+abCgITCUSi9lfwvfplqfd0NWJv/OZ4iZFvLLhO0osg/BJibLnA8/aPqnI/mJs7/kzIPjNg==","shasum":"7c0cc5a9f2caa9d2e203621666b63067ec6c833b","tarball":"https://registry.npmjs.org/@algorithm.ts/bipartite-graph-matching/-/bipartite-graph-matching-2.0.0.tgz","fileCount":6,"unpackedSize":12503,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJh/3diCRA9TVsSAnZWagAArhwQAIvZMK8YGeK0dvMTLi3F\nmVRRGy2jykPpWF1iJdOwL43H8f979l+F0HCtClDXUuR98Qvj28nDHk7GJ2PP\nuOLIrsJ7+P7PtzEZTCMyPr/icnV99p2vfKJcqOyV3jDL2jy866jhNtpSBwCP\nlPtXZMKPY/6yNCv4SBij6gIiyKaf8iX7LXUzpe+WlB4Cbck0b4AEbQUketBw\nA9mEeMmab0Z3MJ1Lq4CPoUb20+YbSa18uqjRbgpLfVPIcPMisUPaIacBwvEn\nPEv4nEo5l/f80ZVpmL3j0saRvEkB6fZCdRTiwd+f45bFX/h4EMpI99/2We9W\nP2IjAKl04NOPiE4FIGNQ5JNVfEbXxt5qek0zzgI+r6NPofLoTb2TsK0f9Ba/\n4iHBKiWvQhQeIepGhLVa/Ho56M9FTMF47Kv9hZs5MHcZFnXug7uSNhYkw7nS\nQlVFc3UF1Y3+/BFxnCQgydBFZytOjzF9pyEONIOg7mIKaMRYptdukmIpZag3\np5JJa+aSn2gczjH46LV5UFbq0veIvYtu2lF4A80g/8p+0Kbbhi3aiVii9jPM\nGX2xPIcc5H4pLdqHV5vGr8Fbz1DGFNP/aDqSj5uYm1MXe9phPE4PKI1kwO3C\neokkYeR/FdCwa8RWScPdiGlGY7zm6HyWpGVR446NNd4xGyvLtI0WZgbXAQI8\nJHaE\r\n=k7rl\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQC0qzbAXdUMnr+1ICegJC16F+I8yFn46AcZ6VpP3UPIsQIgAmKWvqZZHWZL0UYyOmTgWdZ3d1n/kN7WbHEBZeZMC5c="}]},"_npmUser":{"name":"lemonclown","email":"me.guanghechen@gmail.com"},"directories":{},"maintainers":[{"name":"lemonclown","email":"me.guanghechen@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/bipartite-graph-matching_2.0.0_1644132194662_0.9736000667468672"},"_hasShrinkwrap":false},"2.0.1":{"name":"@algorithm.ts/bipartite-graph-matching","version":"2.0.1","description":"The algorithm to find the maximum matching of the bipartite graph.","author":{"name":"guanghechen","url":"https://github.com/guanghechen/"},"repository":{"type":"git","url":"git+https://github.com/guanghechen/algorithm.ts.git","directory":"packages/bipartite-graph-matching"},"homepage":"https://github.com/guanghechen/algorithm.ts/tree/main/packages/bipartite-graph-matching#readme","keywords":["algorithm","bipartite-graph-matching","bipartite-graph-matching + priority-queue","shortest path","single source shortest path"],"main":"lib/cjs/index.js","module":"lib/esm/index.js","types":"lib/types/index.d.ts","source":"src/index.ts","license":"MIT","engines":{"node":">= 14.15.0"},"scripts":{"build":"cross-env NODE_ENV=production rollup -c ../../rollup.config.js","prebuild":"rimraf lib/ && tsc -p tsconfig.src.json --emitDeclarationOnly","prepublishOnly":"cross-env ROLLUP_SHOULD_SOURCEMAP=false yarn build","test":"cross-env TS_NODE_FILES=true jest --config ../../jest.config.js --rootDir ."},"gitHead":"cac97b1cbdc95e0c0914b24ea4e4d25e40bb15c5","bugs":{"url":"https://github.com/guanghechen/algorithm.ts/issues"},"_id":"@algorithm.ts/bipartite-graph-matching@2.0.1","_nodeVersion":"14.17.1","_npmVersion":"lerna/4.0.0/node@v14.17.1+x64 (linux)","dist":{"integrity":"sha512-/tAUzoWj/HJx7erGd7K2xm9m2a6UPJYouk8E/qaoz61mmtccEb9BWqdSDJ5x6UL/UtBsKMV4Odlxrh5WvH1YVQ==","shasum":"bcb71c5099f8b99f08cbffed630ebf490e3d4c3d","tarball":"https://registry.npmjs.org/@algorithm.ts/bipartite-graph-matching/-/bipartite-graph-matching-2.0.1.tgz","fileCount":6,"unpackedSize":12543,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v4.10.10\r\nComment: https://openpgpjs.org\r\n\r\nwsFzBAEBCAAGBQJiFOIIACEJED1NWxICdlZqFiEECWMYAoorWMhJKdjhPU1b\r\nEgJ2Vmot9w//R0ER4g8hZMETYtYxnDz6Eg8y4lsX2MXxepZug3PEJRC3Nxx6\r\n/4e8OIKOvAE2YQ0AAxsOXzQ5Wt093woduquxehQ99gkLLBHnJujoPF9yiIu7\r\nIBUUiSALFYt8kZ/UR1FE4hAvBThFR0TTSANDUfy0LCEHdY3eJ2awcjJEFlTt\r\nE40STzudBD6uoMi5fcdtGfVXzICatgR2Mz+uiYAnyAl9n7z6nhoOU+6AI3iq\r\nt05qwMspOgvwatzHbj+tYyad6ywoFIAn4rFSZZqHqPnMkedKcivEsgfOljDI\r\nsbeBTWXrS/itoRTWMFJK1zJ4Yu3xeYzxJYBplsd6Y4eYvm8+B1goWs0hikUU\r\nURk+u4lSHO5LAsRUba0YW3OzZfdhHa02DCG/sZ6FJCG87/Q/7CfHXe4P/Cf2\r\npUCdtDXAug5GkfHSTG9ILIeY52te0Bw+7MVbWI1W3Zn+fS5VX/yvovxzmjVu\r\nkqVf2w51XMNOITpmXAUThgYA9X9kE1CtC8j+6jSBVo0nWFhgIWPZYnPCfcR/\r\n6Odlu+lfgy3J71DCw4EejopBP5n8BrvfmyHkZXM0hGYtkJx4hUoDBs4ThA0T\r\npgAFglaFIk/mQm18DO9BVQijaaO4UErHa7Ahi8NkCyUMHIILht4iuYjFtZBd\r\ngVZOSXbKY1Gw153m+60L9X6k79daDDtM51M=\r\n=Xpy6\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDWCGu4gUFNhC/h/gVeVpQeK+E+ivFB5j5KA6c6NETKigIhAIluGqsAy6GsoHkbtULoYitub9/jmJnHPeXOzfL9MJr+"}]},"_npmUser":{"name":"lemonclown","email":"me.guanghechen@gmail.com"},"directories":{},"maintainers":[{"name":"lemonclown","email":"me.guanghechen@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/bipartite-graph-matching_2.0.1_1645535752638_0.6672600537275761"},"_hasShrinkwrap":false},"2.0.2":{"name":"@algorithm.ts/bipartite-graph-matching","version":"2.0.2","description":"The algorithm to find the maximum matching of the bipartite graph.","author":{"name":"guanghechen","url":"https://github.com/guanghechen/"},"repository":{"type":"git","url":"git+https://github.com/guanghechen/algorithm.ts.git","directory":"packages/bipartite-graph-matching"},"homepage":"https://github.com/guanghechen/algorithm.ts/tree/main/packages/bipartite-graph-matching#readme","keywords":["algorithm","bipartite-graph-matching","bipartite-graph-matching + priority-queue","shortest path","single source shortest path"],"main":"lib/cjs/index.js","module":"lib/esm/index.js","types":"lib/types/index.d.ts","source":"src/index.ts","license":"MIT","engines":{"node":">= 14.15.0"},"scripts":{"build":"cross-env NODE_ENV=production rollup -c ../../rollup.config.js","prebuild":"rimraf lib/ && tsc -p tsconfig.src.json --emitDeclarationOnly","prepublishOnly":"cross-env ROLLUP_SHOULD_SOURCEMAP=false yarn build","test":"cross-env TS_NODE_FILES=true jest --config ../../jest.config.js --rootDir ."},"gitHead":"386ea6eef0154a42689f03c4943c526a1234db45","bugs":{"url":"https://github.com/guanghechen/algorithm.ts/issues"},"_id":"@algorithm.ts/bipartite-graph-matching@2.0.2","_nodeVersion":"14.17.1","_npmVersion":"lerna/4.0.0/node@v14.17.1+x64 (linux)","dist":{"integrity":"sha512-1ZJqx2TSFHisVD5jdImD6oKbXUDJ2bMCkrzQIe5o2Fqocmk7s6ZMEObHxs5mL9JCuy99+CGHZEmpX8/3rZgKPw==","shasum":"9db1d5cd17b79b524e5f16b78f493401cac6c666","tarball":"https://registry.npmjs.org/@algorithm.ts/bipartite-graph-matching/-/bipartite-graph-matching-2.0.2.tgz","fileCount":6,"unpackedSize":12543,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v4.10.10\r\nComment: https://openpgpjs.org\r\n\r\nwsFzBAEBCAAGBQJiFzn8ACEJED1NWxICdlZqFiEECWMYAoorWMhJKdjhPU1b\r\nEgJ2VmpYNw/+J7QVaiZGrVRfc2Ps77bkBxdtrMiMMntxObHLfhnzRVJFBrY2\r\nZ3XVMMEcqjssZNHiRD0m4BYolRObQgODVoPOnQh3623buiiWTBQrb/NIvCGX\r\ne+vgNDtHis2lo0b04wrvUf9Bv9X0h2u/z3QYsAsLr5VUUEhYVU7vIB6uYy4O\r\n3QiRbOFjBhEZIKXOiXCVYXj7U3lItpVK52p/PrEmVVgieHhgeuZxrqi5sbS4\r\nebQQoqgxoTPT9jrSiy4QHxAhk9M9P0wk0QBlxoO7R+8RVuUCuvQInevuJ5tj\r\ncVLYvt7LsN+/c65E8IUW4QxyrO5WfTIsfEQmGbxkZ/hjeUF6jkXYN/PBhkr9\r\nNVGeAOf9sNQocttcw6A5q8gyYAGlhQkeY27mxzBRKI+VrNudjPh7bJDKkS1k\r\ny1PN3UJYVTW6PI6QLoYhLRR5ZC+wPhNpH+JSLNZ0qEFe4ZeSBTBMFR99/mV+\r\nRj7kg7b20poBAyCdeDumIGnr5zw0k++Gl1zgdbFBJW83zOb00zdpZb3h/qHs\r\nXGLJe5flY4OaoeoGgQ5WWbZFRZmvx5e341FO9PNHyrR268V+Mx7hJAd9KfH7\r\nIGbi7zaDprKDwjlrLMto8ffjticZnvjRKY+6DcSWkU0fYCHwG/61tsA+6KG3\r\nXvtOmT36mRmmyXa5qk5tlNIySP+QpOhR9D0=\r\n=nlD6\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIHagmWU3VNDKK+KoO5q/OkL0WdYBLML2QbFEOLm22jBSAiEAjkvaWOn2J0nltHkyGwo3nH+J129Kjy5e13WhMVWyhOU="}]},"_npmUser":{"name":"lemonclown","email":"me.guanghechen@gmail.com"},"directories":{},"maintainers":[{"name":"lemonclown","email":"me.guanghechen@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/bipartite-graph-matching_2.0.2_1645689340736_0.09716886120126844"},"_hasShrinkwrap":false},"2.0.3":{"name":"@algorithm.ts/bipartite-graph-matching","version":"2.0.3","description":"The algorithm to find the maximum matching of the bipartite graph.","author":{"name":"guanghechen","url":"https://github.com/guanghechen/"},"repository":{"type":"git","url":"git+https://github.com/guanghechen/algorithm.ts.git","directory":"packages/bipartite-graph-matching"},"homepage":"https://github.com/guanghechen/algorithm.ts/tree/main/packages/bipartite-graph-matching#readme","keywords":["algorithm","bipartite-graph-matching","bipartite-graph-matching + priority-queue","shortest path","single source shortest path"],"main":"lib/cjs/index.js","module":"lib/esm/index.js","types":"lib/types/index.d.ts","source":"src/index.ts","license":"MIT","engines":{"node":">= 14.15.0"},"scripts":{"build":"cross-env NODE_ENV=production rollup -c ../../rollup.config.js","prebuild":"rimraf lib/ && tsc -p tsconfig.src.json --emitDeclarationOnly","prepublishOnly":"cross-env ROLLUP_SHOULD_SOURCEMAP=false yarn build","test":"cross-env TS_NODE_FILES=true jest --config ../../jest.config.js --rootDir ."},"gitHead":"bfd7ee8420771cc02f7ef53833ba17780192cc88","bugs":{"url":"https://github.com/guanghechen/algorithm.ts/issues"},"_id":"@algorithm.ts/bipartite-graph-matching@2.0.3","_nodeVersion":"14.17.1","_npmVersion":"lerna/4.0.0/node@v14.17.1+x64 (linux)","dist":{"integrity":"sha512-N4AfT9Eb79L3tckOgCp8QzXKwfP0NDefxkS/+gaY4uO0pwUkv+AKSFDtEasK3gDvLr8/qUm9POz3FYWhwCIkog==","shasum":"089f02c52e7ab719556a4a0bf4b3d378576bd3ef","tarball":"https://registry.npmjs.org/@algorithm.ts/bipartite-graph-matching/-/bipartite-graph-matching-2.0.3.tgz","fileCount":6,"unpackedSize":12543,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v4.10.10\r\nComment: https://openpgpjs.org\r\n\r\nwsFzBAEBCAAGBQJiF1n5ACEJED1NWxICdlZqFiEECWMYAoorWMhJKdjhPU1b\r\nEgJ2VmpWYw/8DRRvn4e5cX2cG55T+rB8tbnUqWnrPj2K4p6Gn7xRgOKJwA4e\r\nJNHB7axPBKt4Nm0TLCqQ3Hi7KXnBV+NOF3jXBUr+NASqZne9zTg6yAuK7p+h\r\nQNiVdYC6TAY+9MrPMM8EGP7PS6EGQZmlrIxb5QY1BdrdhtgVMbXkwsw8rR//\r\nvqLWCp3nZC3kVrb/2ag3Zt/dSkzet22024Ff0CWaUHQ4sVPoW3HnAxEWWU+W\r\nLGbggMsF2miQx/jI2JK7aQmPEBN/TbSlqceB5bhSJ4FcgyIt1gsPyfQiPK0u\r\nookQQokalET+dFLIU1x/s9zTXCjdViBnGHDQNzjKSNvARZtcNdV3VehQaOLR\r\nS2Ja3LUinN1XJlFfp7Ic2mV+p1qr4XDAoID1BmIbakAnVAx1Dd3n7Oyh16Vd\r\nAWXIbcu72H4dHvZXF6tfnCxanJ+o+jQ++bwK4w7oxsmyJGhiml97Zkv0B3IW\r\nXdOl7njiRycmGgdXMtfYim+bIXHWJ48a1DxA1naHKpCIw/n3otZ2T52BTQ3H\r\np6jvxC5BCjIyUIYAC3EdWNqx/vKuEUYNBskwAoxxWoQxaxO7ey3rNygvyaJg\r\nGNMWSIc2BjbmEHiy/oNKHMxSDe7bPjialROWl/Qc/KdrCIcYUCBH3L9N3Rqg\r\njtfQw3jgWvP60oUGVUdxD5Dc4Mna0ILEpDo=\r\n=nKqx\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQDki4PXdb9/v1ZyNoldeFawEsgWRfXitzjX4ziJTQNtXAIgXLFuB2iMrFRrNXNprdRQouYbQBZp8R2vP8IB/Des5P8="}]},"_npmUser":{"name":"lemonclown","email":"me.guanghechen@gmail.com"},"directories":{},"maintainers":[{"name":"lemonclown","email":"me.guanghechen@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/bipartite-graph-matching_2.0.3_1645697528884_0.40720287872757255"},"_hasShrinkwrap":false},"2.0.4":{"name":"@algorithm.ts/bipartite-graph-matching","version":"2.0.4","description":"The algorithm to find the maximum matching of the bipartite graph.","author":{"name":"guanghechen","url":"https://github.com/guanghechen/"},"repository":{"type":"git","url":"git+https://github.com/guanghechen/algorithm.ts.git","directory":"packages/bipartite-graph-matching"},"homepage":"https://github.com/guanghechen/algorithm.ts/tree/main/packages/bipartite-graph-matching#readme","keywords":["algorithm","bipartite-graph-matching","bipartite-graph-matching + priority-queue","shortest path","single source shortest path"],"main":"lib/cjs/index.js","module":"lib/esm/index.js","types":"lib/types/index.d.ts","source":"src/index.ts","license":"MIT","engines":{"node":">= 14.15.0"},"scripts":{"build":"cross-env NODE_ENV=production rollup -c ../../rollup.config.js","prebuild":"rimraf lib/ && tsc -p tsconfig.src.json --emitDeclarationOnly","prepublishOnly":"cross-env ROLLUP_SHOULD_SOURCEMAP=false yarn build","test":"cross-env TS_NODE_FILES=true jest --config ../../jest.config.js --rootDir ."},"gitHead":"1f37699b24bbf498fa820a44056c5f7b291308ee","bugs":{"url":"https://github.com/guanghechen/algorithm.ts/issues"},"_id":"@algorithm.ts/bipartite-graph-matching@2.0.4","_nodeVersion":"14.17.1","_npmVersion":"lerna/4.0.0/node@v14.17.1+x64 (linux)","dist":{"integrity":"sha512-7fxYykqYpG0cifpgkUIT0xWqygdSAKQaNLIDD27EqUSP9ZsgRz/LG7k4HUDPx8a2lwYP3ksn5YE2150258UEpg==","shasum":"2892b91c03d1cc6822e4fefcb3df53079598a14f","tarball":"https://registry.npmjs.org/@algorithm.ts/bipartite-graph-matching/-/bipartite-graph-matching-2.0.4.tgz","fileCount":6,"unpackedSize":12543,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v4.10.10\r\nComment: https://openpgpjs.org\r\n\r\nwsFzBAEBCAAGBQJiNz9ZACEJED1NWxICdlZqFiEECWMYAoorWMhJKdjhPU1b\r\nEgJ2VmozHhAAnimw8YhXw6oFO2tUzdD/agoKoKZ9W5F1wPKM8RHsiiP3c5zl\r\n/VJGdaxnPUSZGAZQJv5IN9HoAC9s0TOW4MnbfYAGjjAjt3RHGBRPNJjckt4F\r\nEq4avEAiStGqOQ3qLQvQSVBu/xrsogwpUs4RVWQkzXdrCpfKBF+OADHA378l\r\n6Jcay/2325nBd6xrD2YAk38Fo1OG/vAHCOZLnGLpbQR5P2Zdkj3qAJMv8jk8\r\nuR8qUepAP3PJ43vrcEs0ehxU1gBy9MKMMawS2OqfXr3KdKoXpMFx8YLJ7e9M\r\nErmbusdhZKgrObjsdW+rAT4nHIPbVS2WBRw/KKPAihDAypaI6wtMyEVz2N0J\r\nUgzzu81QLVGrRHLar1qkRvQ80/SrC0tiZPu66r8VNVZijWsK3Z5/nuA713HJ\r\nbfMQ7mLgFT6TguPzAFCyk7V4AjK2zdFxrTDdwS+qrgapsWzYVpnmlsP3Eg91\r\nvlrcAUOG98cT97O9uPlokpq6DSzCjA6jZMPg4wT6egSuS9pD4jM0pXCNS7MF\r\nFytD8ao0Jky7YizNh0OmPhldr05aO/8mGL1UJiNByzBNM9km/LVpHA0cji94\r\nOrXdhkkKUT88G5yvGEP4sGEz43fkDA2WDXknJavkIundaxr3kKyo8Ic8eZMf\r\n4bRssqh1+idtJFxd8f+jYYkEqbupJBaXg1k=\r\n=4UV7\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCICbX+JGWxsVuQ0MCGFrLxdjup3eX6dUUdfomiR/bnsMAAiEA33VpC0RIQLzxzXsa0mzP9tEgtgMa80OooN35V9CQBvk="}]},"_npmUser":{"name":"lemonclown","email":"me.guanghechen@gmail.com"},"directories":{},"maintainers":[{"name":"lemonclown","email":"me.guanghechen@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/bipartite-graph-matching_2.0.4_1647787865540_0.9080663607199557"},"_hasShrinkwrap":false},"2.0.5":{"name":"@algorithm.ts/bipartite-graph-matching","version":"2.0.5","description":"The algorithm to find the maximum matching of the bipartite graph.","author":{"name":"guanghechen","url":"https://github.com/guanghechen/"},"repository":{"type":"git","url":"git+https://github.com/guanghechen/algorithm.ts.git","directory":"packages/bipartite-graph-matching"},"homepage":"https://github.com/guanghechen/algorithm.ts/tree/main/packages/bipartite-graph-matching#readme","keywords":["algorithm","bipartite-graph-matching","bipartite-graph-matching + priority-queue","shortest path","single source shortest path"],"main":"lib/cjs/index.js","module":"lib/esm/index.js","types":"lib/types/index.d.ts","source":"src/index.ts","license":"MIT","engines":{"node":">= 14.15.0"},"scripts":{"build":"cross-env NODE_ENV=production rollup -c ../../rollup.config.js","prebuild":"rimraf lib/ && tsc -p tsconfig.src.json --emitDeclarationOnly","prepublishOnly":"cross-env ROLLUP_SHOULD_SOURCEMAP=false yarn build","test":"cross-env TS_NODE_FILES=true jest --config ../../jest.config.js --rootDir ."},"gitHead":"b6f49a92024b9062f89a47277f692069e3abd9ec","bugs":{"url":"https://github.com/guanghechen/algorithm.ts/issues"},"_id":"@algorithm.ts/bipartite-graph-matching@2.0.5","_nodeVersion":"14.17.1","_npmVersion":"lerna/4.0.0/node@v14.17.1+x64 (linux)","dist":{"integrity":"sha512-d88yKuMH9DO1lahOP57KIwTpayYdQHDCUqWES0KXSyaox7b5mdM38rLWks1hNMy8q/fF/wiGoTDSCSivCakiOQ==","shasum":"5476723ea7c374dd49c5f2ef21797d8bee7a71aa","tarball":"https://registry.npmjs.org/@algorithm.ts/bipartite-graph-matching/-/bipartite-graph-matching-2.0.5.tgz","fileCount":6,"unpackedSize":12543,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v4.10.10\r\nComment: https://openpgpjs.org\r\n\r\nwsFzBAEBCAAGBQJiOyG4ACEJED1NWxICdlZqFiEECWMYAoorWMhJKdjhPU1b\r\nEgJ2Vmqt3Q//enSTEP2SsM/vHWvLDvZxur4QuW0Y2l8j1dFrrBRZLfmoG41n\r\nIFvIMApY5M8lP8BkG9CZYUqyhTr3HL3JVNknbPxREma5+I9fSDb5IfOQv95T\r\nUPSynExhYXi3v4kIXfABjJzeplnOHz4A/xn/UBzXCJXOiB9GzNR1viuk1sdV\r\n7zxoPTi74b8sM96vbaGFwOsxC9AHLKyWZSiJqU/9D9MjFwQiRtWlySaFiaiN\r\nhIZKAwQLJlRiMtJVlylPjTqXL9J4CgloMQyDbYxzb1HE5m5PeDmVKBbeSFM8\r\nrvk9cjeW+LNsBfbxCBWO4XQe/2gBCu9ltqErZhPoKrWdro8W2n4DAyHqhDbl\r\nefzwtFH811br9xBAh23Kq02C1OlyOrhuIlDR3Jh2y37kEFBq3KWQxVBDd0hO\r\nd1tDw7G/fHAUL8AXGpeUxymqzBOSvBTLaRXiW/aswn4vMLH5J9ZJ9jw4k4bD\r\nuVFNrducIlzC9XhmCovVHluD8azqcigKbx1+m3/rbZFh3480njgY04x+2/VE\r\nzFEs0eKXAisyNGK5YYDI6tu0PqOOQEbRKs6atcavZ8l5Bu0eVnv+xLsbs7CT\r\nl2WjanG5yRf9EC2eRDXJlL8UnORS2XS2rgp2wEyWtqHGb5ufPjSE/WDjWoK8\r\n78m58IvAvPCbGkx8Gpd1kWNFGV4GH2/eGzQ=\r\n=umYC\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCf7N7zUxrmgogQHbCNCAg6cqp5rRZby7gqVauR5TSd7QIhALXgClKzxuJA/h96g9qG50a1HoazMTLvZHV1b6t8glSv"}]},"_npmUser":{"name":"lemonclown","email":"me.guanghechen@gmail.com"},"directories":{},"maintainers":[{"name":"lemonclown","email":"me.guanghechen@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/bipartite-graph-matching_2.0.5_1648042423881_0.06878914940744774"},"_hasShrinkwrap":false},"2.0.6":{"name":"@algorithm.ts/bipartite-graph-matching","version":"2.0.6","description":"The algorithm to find the maximum matching of the bipartite graph.","author":{"name":"guanghechen","url":"https://github.com/guanghechen/"},"repository":{"type":"git","url":"git+https://github.com/guanghechen/algorithm.ts.git","directory":"packages/bipartite-graph-matching"},"homepage":"https://github.com/guanghechen/algorithm.ts/tree/main/packages/bipartite-graph-matching#readme","keywords":["algorithm","bipartite-graph-matching","bipartite-graph-matching + priority-queue","shortest path","single source shortest path"],"main":"lib/cjs/index.js","module":"lib/esm/index.js","types":"lib/types/index.d.ts","source":"src/index.ts","license":"MIT","engines":{"node":">= 14.15.0"},"scripts":{"build":"cross-env NODE_ENV=production rollup -c ../../rollup.config.js","prebuild":"rimraf lib/ && tsc -p tsconfig.src.json --emitDeclarationOnly","prepublishOnly":"cross-env ROLLUP_SHOULD_SOURCEMAP=false yarn build","test":"cross-env TS_NODE_FILES=true jest --config ../../jest.config.js --rootDir ."},"gitHead":"27a96ca7e37b440880b5fd3be8bd1bd08939104e","bugs":{"url":"https://github.com/guanghechen/algorithm.ts/issues"},"_id":"@algorithm.ts/bipartite-graph-matching@2.0.6","_nodeVersion":"14.17.1","_npmVersion":"lerna/4.0.0/node@v14.17.1+x64 (linux)","dist":{"integrity":"sha512-H3BDCcwe+2aCVefIDpMQI/JyOg4fCAsLKmklk+PY/EzR1EUxN1Alg7fpH8gIgfRAT7FwCpZDZT3OtXMqHumObQ==","shasum":"6b5e8540ea8cfab66adedaeef472ab696e9e6bec","tarball":"https://registry.npmjs.org/@algorithm.ts/bipartite-graph-matching/-/bipartite-graph-matching-2.0.6.tgz","fileCount":6,"unpackedSize":12543,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v4.10.10\r\nComment: https://openpgpjs.org\r\n\r\nwsFzBAEBCAAGBQJiPpsmACEJED1NWxICdlZqFiEECWMYAoorWMhJKdjhPU1b\r\nEgJ2Vmr+bQ/+OOMYqXUElw5ieQTyb3yIXE1Z8hib6V/JNcT2IaB1yLmM2Z39\r\n29FHTSeyCzT0AIP9UmNS25drB+M/tOk62hKTeGCZYNUPj4oSvbdTHl6OQA2H\r\nRbqX9CLmLceIJXoAtKZTnqXIbBUhLALU7AkwnfJct1oXO3HMq9P2wt4FVVpu\r\nWPg5uIJ9KtZAatK8nfgllPZ4DRcz4c4LmZ7r7fZg/T/Ikak2hOg5rwrf4fTo\r\nYsWDgn39mmfafv5SggzSZD89qxr7Iv2sSVIffj9WhnpJj0KPXUCdlU+LOwCN\r\nOTjDSL0994GnSkcR4g8ok8M76g1USj/VZDGo7Bbrzp7RMTiGC+ZQOGYexbBD\r\nT/pae+IHkgt14MSUsJAi9bJU4+edNQPyGJbfmZNI2mm6SRF+rEQGz/mDRimF\r\ngMIxqCsBC9+s0pj1GvZIjHM0izKSgi6Vs9NUPVVyE4DZq3YX5xoszyU+FgfN\r\nsA2Bxoi6KUm345V0LyNSxte2Lw9Hf1ciIJOJDhgS8xVsepBuuTlHkdPUWlEP\r\nDT7CevTZn9H9LFQ3a9u6J+QfEJNaQKd/yoHuzLZuADCp9cm8oxTdZFi42E9v\r\nCqwHe5aNaWmjR9VyQJ1B79vGejMvDTz5ifHsPFsCZ5l62ktrwt5mLTQPSBNM\r\nEeEqC66KA99S1jFJeOwW/O0CcS9M6klod1U=\r\n=SZHY\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIE5XHINN7a6rtbaFl954Tk3qm8U/HUflVi/EZhvPvbg7AiEAtwWc55S33LnZqd38kHsf0bdA1oXGBRyltL0QEquOAt4="}]},"_npmUser":{"name":"lemonclown","email":"me.guanghechen@gmail.com"},"directories":{},"maintainers":[{"name":"lemonclown","email":"me.guanghechen@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/bipartite-graph-matching_2.0.6_1648270117878_0.571282681354941"},"_hasShrinkwrap":false},"2.0.7-alpha.0":{"name":"@algorithm.ts/bipartite-graph-matching","version":"2.0.7-alpha.0","description":"The algorithm to find the maximum matching of the bipartite graph.","author":{"name":"guanghechen","url":"https://github.com/guanghechen/"},"repository":{"type":"git","url":"git+https://github.com/guanghechen/algorithm.ts.git","directory":"packages/bipartite-graph-matching"},"homepage":"https://github.com/guanghechen/algorithm.ts/tree/main/packages/bipartite-graph-matching#readme","keywords":["algorithm","bipartite-graph-matching","bipartite-graph-matching + priority-queue","shortest path","single source shortest path"],"main":"lib/cjs/index.js","module":"lib/esm/index.js","types":"lib/types/index.d.ts","source":"src/index.ts","license":"MIT","engines":{"node":">= 14.15.0"},"scripts":{"build":"cross-env NODE_ENV=production rollup -c ../../rollup.config.js","prebuild":"rimraf lib/ && tsc -p tsconfig.src.json --emitDeclarationOnly","prepublishOnly":"cross-env ROLLUP_SHOULD_SOURCEMAP=false yarn build","test":"cross-env TS_NODE_FILES=true jest --config ../../jest.config.js --rootDir ."},"gitHead":"8a89b2b68855a8eee6b244188792bd294e56045f","bugs":{"url":"https://github.com/guanghechen/algorithm.ts/issues"},"_id":"@algorithm.ts/bipartite-graph-matching@2.0.7-alpha.0","_nodeVersion":"14.17.1","_npmVersion":"lerna/4.0.0/node@v14.17.1+x64 (linux)","dist":{"integrity":"sha512-mhEfd2TKNhKs0mw/5cieewSxOuYJddH5eJkxd6hG6wMrxIHvo/Y4mzH4NiJY8HJWbsP598QFAPpWH+dOGWm16w==","shasum":"dc7f007b23988c2ba6efd68a7fcc9afde0a250a9","tarball":"https://registry.npmjs.org/@algorithm.ts/bipartite-graph-matching/-/bipartite-graph-matching-2.0.7-alpha.0.tgz","fileCount":6,"unpackedSize":12551,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v4.10.10\r\nComment: https://openpgpjs.org\r\n\r\nwsFzBAEBCAAGBQJiQIzYACEJED1NWxICdlZqFiEECWMYAoorWMhJKdjhPU1b\r\nEgJ2VmozqA/8Dlfhe2YifYvUDrdPfldpLTSq5Vcnda6ggoOnltgiZZWxG3F7\r\nZPHFzf9GEHslRSc4unKIk6/BcXqBNJJ0REKGVKNKbCkxrsI3BN72VEHYzUmZ\r\nkckd0qBbRb/WtO0D0REtx+lOuoFDQM3zhr5SlFzHh3otmB8VbTGzZ09uFbex\r\n5jLkVOdcptHVg1ctZCRPUUJVqol/QsYHMDenbyaC7u3RR6SthDLRiZGfxZKd\r\n7TX4OOXuVpAvayXaxsBam2ixjrZpmryq7GwROYPjbGgA7XYwCpVU5uTaV706\r\ngSFWsUtUFV7dfj4dzDuKFTAjr7BUvDrSxwZSDw4wOIMYWSGowUkJyPkqV/9E\r\nz8L94KfoQQISG8Gy20Sp+vqJO2kyXMGl99yx+u16W55A7rplOCt1xsVnEmC1\r\nkk1vshrfAzN97djWJ4dAO46SSOZs6B+ndFx91XU6XKSK32/PRlkFEFOxmKtU\r\nZYtzFB2meG9QF8tYGzmWfDjbss+O7u+ltKMOHICaogkfW66ssz4RBdKmpfCX\r\n0nFnXX8HbjvO4by2kD9bhpT9SkvH6pM8hzNQVFnwAHNSKkjmMxpFvlDn/k8g\r\n6/sRBQBLQubmynaWYbNCksmzAXyLzYxnMoW3tF+pYY8bAbSyXfh3DQ4DbKzt\r\nx2kzvgAbd+r5Fr7QEVRcBU1JaTCZTIcPtDs=\r\n=sq2y\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCICX8c858WwLHgZQFcfu9nMhUx+Yf145aFkW7tiC0NYjtAiAsnqK2akIGjArq35kJi7q1b13xHwVexMFkdEzGEJuS7Q=="}]},"_npmUser":{"name":"lemonclown","email":"me.guanghechen@gmail.com"},"directories":{},"maintainers":[{"name":"lemonclown","email":"me.guanghechen@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/bipartite-graph-matching_2.0.7-alpha.0_1648397528560_0.7169545684176042"},"_hasShrinkwrap":false},"2.0.7-alpha.1":{"name":"@algorithm.ts/bipartite-graph-matching","version":"2.0.7-alpha.1","description":"The algorithm to find the maximum matching of the bipartite graph.","author":{"name":"guanghechen","url":"https://github.com/guanghechen/"},"repository":{"type":"git","url":"git+https://github.com/guanghechen/algorithm.ts.git","directory":"packages/bipartite-graph-matching"},"homepage":"https://github.com/guanghechen/algorithm.ts/tree/main/packages/bipartite-graph-matching#readme","keywords":["algorithm","bipartite-graph-matching","bipartite-graph-matching + priority-queue","shortest path","single source shortest path"],"main":"lib/cjs/index.js","module":"lib/esm/index.js","types":"lib/types/index.d.ts","source":"src/index.ts","license":"MIT","engines":{"node":">= 14.15.0"},"scripts":{"build":"cross-env NODE_ENV=production rollup -c ../../rollup.config.js","prebuild":"rimraf lib/ && tsc -p tsconfig.src.json --emitDeclarationOnly","prepublishOnly":"cross-env ROLLUP_SHOULD_SOURCEMAP=false yarn build","test":"cross-env TS_NODE_FILES=true jest --config ../../jest.config.js --rootDir ."},"gitHead":"fd487f425bd3b8273a414ead8b697010fe1a3a83","bugs":{"url":"https://github.com/guanghechen/algorithm.ts/issues"},"_id":"@algorithm.ts/bipartite-graph-matching@2.0.7-alpha.1","_nodeVersion":"14.17.1","_npmVersion":"lerna/4.0.0/node@v14.17.1+x64 (linux)","dist":{"integrity":"sha512-ZKan8kPtbjwZ6Hcix7Dd3y/9OUhBbi3ESXXVmFRU/EM7tGnoM44Hc5x0mTjfulnCBRwd/aCqSkwN3WEFJ6aeCg==","shasum":"8460dd39a1df0c400f88632e9d14fecddde058a9","tarball":"https://registry.npmjs.org/@algorithm.ts/bipartite-graph-matching/-/bipartite-graph-matching-2.0.7-alpha.1.tgz","fileCount":6,"unpackedSize":12551,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQD5uLhtjSpvaSsXgmdFTDZiI5rBCugUSOV8JFfhw4LY7wIhAJwZkOaYeYBrKSo++8jyj7ifHZNUpUE5iIMitWITq68m"}],"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v4.10.10\r\nComment: https://openpgpjs.org\r\n\r\nwsFzBAEBCAAGBQJiSXiCACEJED1NWxICdlZqFiEECWMYAoorWMhJKdjhPU1b\r\nEgJ2Vmr8nxAAk7VZJO2j7WoxcX4kEF+bstix1U7NS9+aJsKCM+O3G684OzdL\r\nsY1YCpqWbByh2vCtRfTTEb2pdxsZgUpjmFq0Lc2G5QYo+xaT7CfYXpoXQ5S6\r\nagj1xvbADyCB19nkYEghN7hwCcwqHAQWj5HmzzMCloju1tRLJzFMNSVA9TXo\r\nqWHADSiy7DCKXof0qPeP9q0UwwNXu+ByfTrqJQVGiKb1bNf1ejFGwLzBNzY0\r\nj/9gdccl1XA8asCH6n8VewGz1gFjfFjsUWNTbRQfAoxOi8NVvYUJOocrIWVl\r\ndCJcJHR6OZBbJ+Ik+GQvhmcp3oXssFkhjeVkUJCPuRwJ22cf1+I9x8jvWluT\r\n0Inxm1dThUV/nQCFvaBbPnSO+j76pYkNU7bmjhWI3ZgrgYYvzSkTjaDmnFwi\r\n7mdnpeGzMjK4nlBUKhuVddgdEeGSeBKw9MN9Y6K1ky1vjNOwlOgoedPqpWwV\r\nWQ0nWjxJQrjV+0LS2fOEZdSvUyZTBdfP0+EFiJY/DBwEPgCoLG26mzvqDhJq\r\neE14uq3/JQ8k0fzjbUGJhwPxQFGCCCfaIOKIOEtbe9zp7o0RSDwWh3g4LdG5\r\nLJn3LrX+1g8O+oKG6bQfY3N+FwqScKJbFmLBXtIC6m+SWFyR9m3y/RMz/pUW\r\nR90lFWHGEj/dBuGlMSjoiF/JI7s5PgghgLI=\r\n=1Ech\r\n-----END PGP SIGNATURE-----\r\n"},"_npmUser":{"name":"lemonclown","email":"me.guanghechen@gmail.com"},"directories":{},"maintainers":[{"name":"lemonclown","email":"me.guanghechen@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/bipartite-graph-matching_2.0.7-alpha.1_1648982146338_0.5785399656883936"},"_hasShrinkwrap":false},"2.0.7":{"name":"@algorithm.ts/bipartite-graph-matching","version":"2.0.7","description":"The algorithm to find the maximum matching of the bipartite graph.","author":{"name":"guanghechen","url":"https://github.com/guanghechen/"},"repository":{"type":"git","url":"git+https://github.com/guanghechen/algorithm.ts.git","directory":"packages/bipartite-graph-matching"},"homepage":"https://github.com/guanghechen/algorithm.ts/tree/main/packages/bipartite-graph-matching#readme","keywords":["algorithm","bipartite-graph-matching","bipartite-graph-matching + priority-queue","shortest path","single source shortest path"],"main":"lib/cjs/index.js","module":"lib/esm/index.js","types":"lib/types/index.d.ts","source":"src/index.ts","license":"MIT","engines":{"node":">= 14.15.0"},"scripts":{"build":"cross-env NODE_ENV=production rollup -c ../../rollup.config.js","prebuild":"rimraf lib/ && tsc -p tsconfig.src.json --emitDeclarationOnly","prepublishOnly":"cross-env ROLLUP_SHOULD_SOURCEMAP=false yarn build","test":"cross-env TS_NODE_FILES=true jest --config ../../jest.config.js --rootDir ."},"gitHead":"814bc48415c5bbea555e0807b8a862cf348df5c1","bugs":{"url":"https://github.com/guanghechen/algorithm.ts/issues"},"_id":"@algorithm.ts/bipartite-graph-matching@2.0.7","_nodeVersion":"14.17.1","_npmVersion":"lerna/4.0.0/node@v14.17.1+x64 (linux)","dist":{"integrity":"sha512-flijKuMJ/lGBNyT19TbgUfB9UdTYDWAvjnwaJzTcdUM2o+CfXmET0FB0RB85U9N/M/Dj5w2kipRDBpRgWzE2vg==","shasum":"f329cdd24306390659e6f260034d06e1fc1af822","tarball":"https://registry.npmjs.org/@algorithm.ts/bipartite-graph-matching/-/bipartite-graph-matching-2.0.7.tgz","fileCount":6,"unpackedSize":12543,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQDCHWYRmo/EyjfhzUZ2SvNszzJNsbcHR4qF7zhcE+xnIwIgInJqbPQGBDvSCb6BdPRRapx2VqH4BGVozxi5PDekSd8="}],"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v4.10.10\r\nComment: https://openpgpjs.org\r\n\r\nwsFzBAEBCAAGBQJiScAkACEJED1NWxICdlZqFiEECWMYAoorWMhJKdjhPU1b\r\nEgJ2VmqfpQ/+J6Oa/eyDVAk2qSxxG5ilGZXTD1yyEpWOcdlqZxW/eCZOqJsk\r\ntXfoZi1PAK3WR77hZX30YjUO7Mu2upodDRHBZ+wBkrCzDUeVpbc+cx4tEOvO\r\n8nN/y5vcX+cNDgJOm0WJDDo9ZXOGSDbwQCrovtFupOUsE9yWTc8uQksmmhCm\r\n1e4TSq/a4ld1qjfAv3p05UCSJZDuVi7umpEHS4RmHGYxfLpzSp23YsM1AKjs\r\nmZs+hSyexNm7I0s99se0Yx38V58zmyq4UlXeEQjvC8/1cORWdHU75qR7IYOP\r\nohsmmVGfnk7eDIcLhfNts8phZUeuM82r9XXDbKaucNmOAPBWwuTCmTiwuLNh\r\n6Jfh2CnQWFtd4pb8SWLGCxrbRYH0jTlNZecP0QVq6omJTzKBzUxuGPq2L3MJ\r\n2TacdrRHQ4/cHF7P2BBEnfsuQGCRaEHLz3Znl9RcQdIe9s3uIXUe66TifY6L\r\n+HiV57kf6rOYju2xn6hBlxpviX7GDDeVr+VH4LQ7i4ZlD/TwgEpt7UFcYLln\r\nGhR/yrT81MNJ+KWQSluQ7EJQoQKAkJ/kgWXN0F7cuHeWrMjQg+B9bg3Jhu+U\r\nsNPfaUVPVwmiMg8m2jPsc67OURnrUOfDG5OdoDDW0lQpDmiczbxrkKGBmtdz\r\n0Tfb05/0T/BEWYIyIwta3Kj5JUUofdQZcrw=\r\n=w+hg\r\n-----END PGP SIGNATURE-----\r\n"},"_npmUser":{"name":"lemonclown","email":"me.guanghechen@gmail.com"},"directories":{},"maintainers":[{"name":"lemonclown","email":"me.guanghechen@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/bipartite-graph-matching_2.0.7_1649000484750_0.580328739948442"},"_hasShrinkwrap":false},"2.0.8-alpha.0":{"name":"@algorithm.ts/bipartite-graph-matching","version":"2.0.8-alpha.0","description":"The algorithm to find the maximum matching of the bipartite graph.","author":{"name":"guanghechen","url":"https://github.com/guanghechen/"},"repository":{"type":"git","url":"git+https://github.com/guanghechen/algorithm.ts.git","directory":"packages/bipartite-graph-matching"},"homepage":"https://github.com/guanghechen/algorithm.ts/tree/main/packages/bipartite-graph-matching#readme","keywords":["algorithm","bipartite-graph-matching","bipartite-graph-matching + priority-queue","shortest path","single source shortest path"],"main":"lib/cjs/index.js","module":"lib/esm/index.js","types":"lib/types/index.d.ts","source":"src/index.ts","license":"MIT","engines":{"node":">= 14.15.0"},"scripts":{"build":"cross-env NODE_ENV=production rollup -c ../../rollup.config.js","prebuild":"rimraf lib/ && tsc -p tsconfig.src.json --emitDeclarationOnly","prepublishOnly":"cross-env ROLLUP_SHOULD_SOURCEMAP=false yarn build","test":"cross-env TS_NODE_FILES=true jest --config ../../jest.config.js --rootDir ."},"gitHead":"24a301c145ad9f6c0e50494de39456c42bb02f29","bugs":{"url":"https://github.com/guanghechen/algorithm.ts/issues"},"_id":"@algorithm.ts/bipartite-graph-matching@2.0.8-alpha.0","_nodeVersion":"14.17.1","_npmVersion":"lerna/4.0.0/node@v14.17.1+x64 (linux)","dist":{"integrity":"sha512-RxagIIz0tqdXlzCM0BREYqhT7zCq5kptnbvNk8udpddstsFsFCVI45xGqa5tyq2OwCkvS2tR8LuRSsfTBV4Ufg==","shasum":"27f1ca3f32f868433798af5eda8ac60c3bef69b7","tarball":"https://registry.npmjs.org/@algorithm.ts/bipartite-graph-matching/-/bipartite-graph-matching-2.0.8-alpha.0.tgz","fileCount":6,"unpackedSize":12551,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQDMd25rlNvwPte2t0kqbSE10fAuGDMyJ+Ku2dyH6sdzygIgMw85dT9WoUxMiz/g/ltl6AYXoXT649aLMylsZ+v6hc0="}],"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v4.10.10\r\nComment: https://openpgpjs.org\r\n\r\nwsFzBAEBCAAGBQJiTGdAACEJED1NWxICdlZqFiEECWMYAoorWMhJKdjhPU1b\r\nEgJ2VmokHw//T1FW/ztj6KuqDDt0zujIXIXYXtTAnvZtPXbAAxQQ1r6Axauw\r\niicykQOYy9PY3RFUS/jTJnkhz/LY+bxPSJsMoCvQ2ki+F3sNHR0CIN+tbydX\r\nt7JZdwdRmnQZGz5ykGBTBzZllx20ebVPRbtSLOqqQdEmxrwTalCfkDe42x90\r\nPkTxdzdnz6szUy/gaCMEwwOIMzECCA6UsOcXNOK1ep+ZCN2m+YpcBqXyB0Ew\r\nN4er3oF9W+8gxfB46wRylvlUlO5gDGef+gMGM4QqHA2IJn2bgFrgVAGr8T9w\r\nYeGLWDlH1g0QiSCRu0gDju+iDu47P9qYk5T7spc3nTSqGHRRs6oUMQGQoPEG\r\nGTLaacBNu5xAiPHH9Ux03RNSoz+RKgaGCBM3wZu/WLFq1q4HjMxRxuWXMrri\r\nlLs24OISi6LtyQGypLqxE3g2uoaPeFBEUury0dHDjHDCja9lApI3K2Tfgj+j\r\n490WS4A2/HD4V1/etGHBTJga6kJjZAZVgMuKRmFxjMGWII4qhrCG0kOFkzjR\r\n39UrtvnDtI4AeHh43qD5wWBdKGL9CP4/LKgjKoFJ4OfNXJFgWPWR023ZMmAZ\r\ny9+Ao8S6UN3HNaNdXxsWFYXB7RMT/dsPagcQ/aGRd/IMBWyfOO5DYZsjLYNp\r\nh9Naup5K+I9oK+AREAjaClW5YjxnIfr194E=\r\n=rqDV\r\n-----END PGP SIGNATURE-----\r\n"},"_npmUser":{"name":"lemonclown","email":"me.guanghechen@gmail.com"},"directories":{},"maintainers":[{"name":"lemonclown","email":"me.guanghechen@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/bipartite-graph-matching_2.0.8-alpha.0_1649174336722_0.28899010110309997"},"_hasShrinkwrap":false},"2.0.8":{"name":"@algorithm.ts/bipartite-graph-matching","version":"2.0.8","description":"The algorithm to find the maximum matching of the bipartite graph.","author":{"name":"guanghechen","url":"https://github.com/guanghechen/"},"repository":{"type":"git","url":"git+https://github.com/guanghechen/algorithm.ts.git","directory":"packages/bipartite-graph-matching"},"homepage":"https://github.com/guanghechen/algorithm.ts/tree/main/packages/bipartite-graph-matching#readme","keywords":["algorithm","bipartite-graph-matching","bipartite-graph-matching + priority-queue","shortest path","single source shortest path"],"main":"lib/cjs/index.js","module":"lib/esm/index.js","types":"lib/types/index.d.ts","source":"src/index.ts","license":"MIT","engines":{"node":">= 14.15.0"},"scripts":{"build":"cross-env NODE_ENV=production rollup -c ../../rollup.config.js","prebuild":"rimraf lib/ && tsc -p tsconfig.src.json --emitDeclarationOnly","prepublishOnly":"cross-env ROLLUP_SHOULD_SOURCEMAP=false yarn build","test":"cross-env TS_NODE_FILES=true jest --config ../../jest.config.js --rootDir ."},"gitHead":"7d921919d03570e772a847763100eb1a58d10d2d","bugs":{"url":"https://github.com/guanghechen/algorithm.ts/issues"},"_id":"@algorithm.ts/bipartite-graph-matching@2.0.8","_nodeVersion":"14.17.1","_npmVersion":"lerna/4.0.0/node@v14.17.1+x64 (linux)","dist":{"integrity":"sha512-ujAwsw7iBuqCUN229BL22c55NOlI0KFuH80lHJxfkMx5/YaIC7SkhLM8Z4NxcK/i27MqGGfqyttfNQKTXJM7XQ==","shasum":"3a00dcbcaeaccef84f0d055a6fcac9a239b3b958","tarball":"https://registry.npmjs.org/@algorithm.ts/bipartite-graph-matching/-/bipartite-graph-matching-2.0.8.tgz","fileCount":6,"unpackedSize":12543,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQDDZMQ8RK13bTi+t9gGXRoqOBGdPw0lm+RHqNgvYd2+igIgAQpAs+T57pyh/jorFcwtjYXrYbj0T1nBDJaw7alBryg="}],"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v4.10.10\r\nComment: https://openpgpjs.org\r\n\r\nwsFzBAEBCAAGBQJiUr+TACEJED1NWxICdlZqFiEECWMYAoorWMhJKdjhPU1b\r\nEgJ2Vmo6hg/+OF4bSYffGfTz3Ez8QEa6/vxtt+cgQR79gXAO6gBNLYOSDeTz\r\nyYscXT0XS84nU8gsHjh58pwxWnQpwojfTljVysGUVr1MgnzbuzbmtCTYruaP\r\nZmBPZNuOzlom3W5fPXUdKdtUz6KiIahhdeiqvd0gU8SSiGMM11cvfqb7RSAg\r\n34/wRgefRO28l1eRzO+8YLq6DcraTt8gBMVhRKvYQQtvbErXolOSJCPJDrht\r\ns4jD4tT+Ek6UeoCX+V4gzOB4tUqgFCw+aoWkSjzvEf2pWNejoLWgmqB0snm6\r\n+OLGOPKznswRBHWam747nx16RecCJp7Br2DBRAPa3PvUZWCPkUWdr2p5oYf8\r\ng/Thu4MKQU+8sT2rSvYsOGeEVjwgldSvxWyAlarTs8HXNwLIw9RFAab9qJLn\r\nQuuWj3ZVXyhNOOZ9oAN1FKwvlCXCsUw8mmAK/WEKWbu/PjCAnFiler3KUZrF\r\ng/CMia5+qEIjHOVycIXXJ8Bi7SpNDFQHvBJQxfMR4cKRw2SNUsVkTUaWThQc\r\nbQ1e7mwSgAWGDAiZfAsFIKaJN12GqUuYAmc19CGxP+Ucq/hYwgRIXvxG1vvO\r\n1bp+D74Dcxlq1pgx6+imXoU69LZ2oydS4rCSfXa7QLmZ0DP0b/sPOIQ1sBoA\r\n6b1yqJXw3N6vMArLW6HzW/XYRPpdeUqhN9Y=\r\n=qWj+\r\n-----END PGP SIGNATURE-----\r\n"},"_npmUser":{"name":"lemonclown","email":"me.guanghechen@gmail.com"},"directories":{},"maintainers":[{"name":"lemonclown","email":"me.guanghechen@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/bipartite-graph-matching_2.0.8_1649590163091_0.872374584796983"},"_hasShrinkwrap":false},"2.0.9":{"name":"@algorithm.ts/bipartite-graph-matching","version":"2.0.9","description":"The algorithm to find the maximum matching of the bipartite graph.","author":{"name":"guanghechen","url":"https://github.com/guanghechen/"},"repository":{"type":"git","url":"git+https://github.com/guanghechen/algorithm.ts.git","directory":"packages/bipartite-graph-matching"},"homepage":"https://github.com/guanghechen/algorithm.ts/tree/main/packages/bipartite-graph-matching#readme","keywords":["algorithm","bipartite-graph-matching","bipartite-graph-matching + priority-queue","shortest path","single source shortest path"],"main":"lib/cjs/index.js","module":"lib/esm/index.js","types":"lib/types/index.d.ts","source":"src/index.ts","license":"MIT","engines":{"node":">= 14.15.0"},"scripts":{"build":"cross-env NODE_ENV=production rollup -c ../../rollup.config.js","prebuild":"rimraf lib/ && tsc -p tsconfig.src.json --emitDeclarationOnly","prepublishOnly":"cross-env ROLLUP_SHOULD_SOURCEMAP=false yarn build","test":"cross-env TS_NODE_FILES=true jest --config ../../jest.config.js --rootDir ."},"gitHead":"1bdac6453d21e3cfeca2e65413e01aa720a34d38","bugs":{"url":"https://github.com/guanghechen/algorithm.ts/issues"},"_id":"@algorithm.ts/bipartite-graph-matching@2.0.9","_nodeVersion":"14.17.1","_npmVersion":"lerna/4.0.0/node@v14.17.1+x64 (linux)","dist":{"integrity":"sha512-5pic4H1M2UtQAy20aqfACUb0U2YhfFTkx2XJHwNxu5RjpxUw1mH6eFP9bTWUx5/O7O9cR4s72RG+5gg/fJIdzQ==","shasum":"3b63c54c09a5d5ffe9dddf25898f174912e5bd69","tarball":"https://registry.npmjs.org/@algorithm.ts/bipartite-graph-matching/-/bipartite-graph-matching-2.0.9.tgz","fileCount":6,"unpackedSize":12543,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIBF3rtv7prD53+hwR87g6YYIFnXH6y/qh0mhYD4SiZLDAiAB/9duF75f5EkeWUqosZWEr2DiUsk1xbgeHo3A7fo74w=="}],"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v4.10.10\r\nComment: https://openpgpjs.org\r\n\r\nwsFzBAEBCAAGBQJiUvJVACEJED1NWxICdlZqFiEECWMYAoorWMhJKdjhPU1b\r\nEgJ2Vmrexg/+I9FsgW4DZj/7iMmOwl6bhQwNbjIp90BFbXSK7iApkNNenBZu\r\nlHVcasoh3qWdERPi8nBTiK5W90c9uiIk/AKTX3wcNYvi62g3jgr4PostNEkm\r\n0uCT07ONCr9Z9JelO+GTO6YllmWf5IfbT5qVy/L4YY/4m16S00zIgAuiNR6R\r\n18Bbx1kFwhyGh5hyppwJ7n5k3A1IvWvTo2bq+W9NZVn08Chdn6LB1GGuOTLc\r\nuV7Wfv66lSQbllsGDxsAYvb+VKujdwP8Tmv3GTGKzjl27Sw1d5y97fv6Q8c5\r\nrly+B23SnxXQq/B8L8pIJuRKndbrIEVY0ZEkHqaDui2b5laPhNpEaOB6Q0fc\r\ngCPBRCzQG1m05SLrhVmDOyEk6mnsBKBQpSqj8MxhGvonAu5ET1Km06EsmFFm\r\n11gPBg/USvUnVwz9amd544R+Cxs48sJX97mooRahokV3phfHkSkr5QFEPHzE\r\nOnFNFUCi8292Fyujxvu+wfuFlxCvcZY3a7nkJ5r/ztBr2n+FX0PM5o87U8wf\r\niwRSBoF/EobImXIC7oQj/VIOI461wtslO2vEIeIr3z+QpRYzUZooRXxOMnwH\r\npn0ler2o0r7ICvCsJ0s22s4+IX4w1mhOu714AMs2wrJWxtGjKFbWtXYvfFo4\r\nV7neOuY5AV51iRxqKphHJEbeEqaFZEK277I=\r\n=9CaE\r\n-----END PGP SIGNATURE-----\r\n"},"_npmUser":{"name":"lemonclown","email":"me.guanghechen@gmail.com"},"directories":{},"maintainers":[{"name":"lemonclown","email":"me.guanghechen@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/bipartite-graph-matching_2.0.9_1649603157099_0.16958007039965062"},"_hasShrinkwrap":false},"2.0.10":{"name":"@algorithm.ts/bipartite-graph-matching","version":"2.0.10","description":"The algorithm to find the maximum matching of the bipartite graph.","author":{"name":"guanghechen","url":"https://github.com/guanghechen/"},"repository":{"type":"git","url":"git+https://github.com/guanghechen/algorithm.ts.git","directory":"packages/bipartite-graph-matching"},"homepage":"https://github.com/guanghechen/algorithm.ts/tree/main/packages/bipartite-graph-matching#readme","keywords":["algorithm","bipartite-graph-matching","bipartite-graph-matching + priority-queue","shortest path","single source shortest path"],"main":"lib/cjs/index.js","module":"lib/esm/index.js","types":"lib/types/index.d.ts","source":"src/index.ts","license":"MIT","engines":{"node":">= 14.15.0"},"scripts":{"build":"cross-env NODE_ENV=production rollup -c ../../rollup.config.js","prebuild":"rimraf lib/ && tsc -p tsconfig.src.json --emitDeclarationOnly","prepublishOnly":"cross-env ROLLUP_SHOULD_SOURCEMAP=false yarn build","test":"cross-env TS_NODE_FILES=true jest --config ../../jest.config.js --rootDir ."},"gitHead":"65694a5108c220d1edff9be57a12bf8c8403e14d","bugs":{"url":"https://github.com/guanghechen/algorithm.ts/issues"},"_id":"@algorithm.ts/bipartite-graph-matching@2.0.10","_nodeVersion":"14.17.1","_npmVersion":"lerna/4.0.0/node@v14.17.1+x64 (linux)","dist":{"integrity":"sha512-NhGXb6AYeX7Eu7Oc9sJ6sowAJS3pB6lpn1CtzIrb8DP1ymZdsB3N6XZAVt3Wnf6GhF59X/OuTQdE1burrF2/ZA==","shasum":"580db395d978e16a9a1d9f32553f57057ccdb7f7","tarball":"https://registry.npmjs.org/@algorithm.ts/bipartite-graph-matching/-/bipartite-graph-matching-2.0.10.tgz","fileCount":6,"unpackedSize":12544,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCID4Vpy3CEH3cP6YH4BgDMWyB0uevfjAC7vZvwlRhM6SRAiBWeHE++C0QNoefEpFZh2ofL+LH9mjX5EUb6C/vfHKaGw=="}],"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v4.10.10\r\nComment: https://openpgpjs.org\r\n\r\nwsFzBAEBCAAGBQJiVZOVACEJED1NWxICdlZqFiEECWMYAoorWMhJKdjhPU1b\r\nEgJ2VmqPRA//VHZQs66YSAjoNkr6oY5GpnScByNLcTA64HprGHher2q+DlG1\r\nF5+a+X3FCXEu8f6pT1CybkynffkN3pUj/t5f8DG3Jq/CwPlSiwQqF80afh7f\r\neKZO3MovvN1Z9PGhGCqAa2r3LnBs84RbXNWEJb8zIGS1whM7gymN+W1dQEqH\r\nuRv40FwK7u0ChiR4FKTb3xbktzfeajwZBgxg6N2g6n8TEhFMEFzJjesx/pZR\r\n2VbblZ5mO1vqsw4iv7tMXOJaVvctGhAWRxtYDXszaSpimjoRPTT0KAzRSSA7\r\nJIjdSQ8Y8fvCDdpv8fJ1o1pI4q64GGb8yUSJRTuMfSLnDZdyvftPtRBhDG4i\r\nTWuNKM+a6z8KFCDOJ5wv9oyVMcfrW2SgcmPiJL6iSNKAZ0yZQxp2LBv88jWa\r\nAtEBBsie6tq6dKy1iZtGZgyzxqJrQ2rXg48kj/uBYaW5aFzABvtTsCIBrtIa\r\n7yG48uAEHof2vuflHJUl3ae/06VGcy8goOtmHxAG2xA4Y83o4PGLvzRNGqTe\r\nEKzD2p7PycgAUZ5Oy2tYX+O3ZrfGzw9IUHmsqlFxucKmNPeTVUQqN8ZAiGiV\r\nRSXSrmWXymTPYo7LKY+kagZuqeqvPZCB0bGC+dJWavrQZF3P3XZOMCxgaG37\r\nguHo58U+lw0PAhbRcIyjiv+AYuQarjiwVjQ=\r\n=hiTz\r\n-----END PGP SIGNATURE-----\r\n"},"_npmUser":{"name":"lemonclown","email":"me.guanghechen@gmail.com"},"directories":{},"maintainers":[{"name":"lemonclown","email":"me.guanghechen@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/bipartite-graph-matching_2.0.10_1649775508912_0.4863519673043466"},"_hasShrinkwrap":false},"2.0.11":{"name":"@algorithm.ts/bipartite-graph-matching","version":"2.0.11","description":"The algorithm to find the maximum matching of the bipartite graph.","author":{"name":"guanghechen","url":"https://github.com/guanghechen/"},"repository":{"type":"git","url":"git+https://github.com/guanghechen/algorithm.ts.git","directory":"packages/bipartite-graph-matching"},"homepage":"https://github.com/guanghechen/algorithm.ts/tree/main/packages/bipartite-graph-matching#readme","keywords":["algorithm","bipartite-graph-matching","bipartite-graph-matching + priority-queue","shortest path","single source shortest path"],"main":"lib/cjs/index.js","module":"lib/esm/index.js","types":"lib/types/index.d.ts","source":"src/index.ts","license":"MIT","engines":{"node":">= 14.15.0"},"scripts":{"build":"cross-env NODE_ENV=production rollup -c ../../rollup.config.js","prebuild":"rimraf lib/ && tsc -p tsconfig.src.json --emitDeclarationOnly","prepublishOnly":"cross-env ROLLUP_SHOULD_SOURCEMAP=false yarn build","test":"cross-env TS_NODE_FILES=true jest --config ../../jest.config.js --rootDir ."},"gitHead":"42feafd0303f51767aa7e498f6de84d9478c1dca","bugs":{"url":"https://github.com/guanghechen/algorithm.ts/issues"},"_id":"@algorithm.ts/bipartite-graph-matching@2.0.11","_nodeVersion":"14.17.1","_npmVersion":"lerna/4.0.0/node@v14.17.1+x64 (linux)","dist":{"integrity":"sha512-FZCuwRzDLBy2UEBIc74R6CPRAR/TEkJp6SHk4/8cWLWhCpMlWXFf0pdPEMy91wAmxHrySmd/jhVWCh7FS7tC5w==","shasum":"b36369603fffb26a5e742b2221c0bd138debe11b","tarball":"https://registry.npmjs.org/@algorithm.ts/bipartite-graph-matching/-/bipartite-graph-matching-2.0.11.tgz","fileCount":6,"unpackedSize":12544,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCcmQIT9Ll7wiCBA4k2WAoI62tt1tfcIYYdQCFJ6m9J2AIhAPMxndYVJdQYZXhHgRrvnY1VlPxMBUkjHDiErYav9y4v"}],"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v4.10.10\r\nComment: https://openpgpjs.org\r\n\r\nwsFzBAEBCAAGBQJiXrX9ACEJED1NWxICdlZqFiEECWMYAoorWMhJKdjhPU1b\r\nEgJ2VmqCxg/9FKT5JOS/K9kanGGyax5lzC6wrWtDS9MUszKVcS6DUmQBSoKW\r\nipGkSTrRxJ5ipkiBqqbh1w646MBF5tSirFeYcIhxGEpTUj3zg/UOQhE9nuyQ\r\nX5bVj7m7K3WFRSXkJxWSgiy4QUrlBbiJHdRPXpIEJvD6H7Uina6bRXTHBMEo\r\nf1dwcdpcyfKh/bXJsOw+O47BrdV4XJwgUd68GKtlqvFVGNJE+n8/RwZiQd6c\r\nFLf/R3xd63bo5MLK2tifQMINPtoImvN7GmumBnNHQKTgVLLri+PfLpFrcSB+\r\noVVsX4FFUPOVWeu7Ur/luzjFoSGocqkZoyuGLzwW48XhJzXQxYJV6+hemTcL\r\nsvl3+ZPmjNCdEtvARVfiE9n737RdeFRdYqZvb+7pP/Vu1+P1QM65DiQTDYwC\r\nXWmE0XuFHA8Cp151Rt0Nct7BkGXYGZR8UcPLE8sT/Gal8gdNGTy5J+LUn+Rq\r\nUc1tJv3gJX2023vRKxB9VqHM13kTweJUUAQVC0/EyNtpVbHQN3oRHhcfwXQH\r\nJcDX4Mh4MLxZr6a+OKj8RBQrnbptpVDYF2CfjebO7QoFmpBOFvJBXnWF5HUR\r\n/mW/5jxCifjWevLTLl/GI6DyzLxrAZZH6+/HRrjl+UXeSPFUcL6m93uFIgz+\r\nbjXtH5YBdbmpwufweU7Ot9LJ6So90SiOaxo=\r\n=1j+G\r\n-----END PGP SIGNATURE-----\r\n"},"_npmUser":{"name":"lemonclown","email":"me.guanghechen@gmail.com"},"directories":{},"maintainers":[{"name":"lemonclown","email":"me.guanghechen@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/bipartite-graph-matching_2.0.11_1650374141670_0.26602275692922017"},"_hasShrinkwrap":false},"2.0.12":{"name":"@algorithm.ts/bipartite-graph-matching","version":"2.0.12","description":"The algorithm to find the maximum matching of the bipartite graph.","author":{"name":"guanghechen","url":"https://github.com/guanghechen/"},"repository":{"type":"git","url":"git+https://github.com/guanghechen/algorithm.ts.git","directory":"packages/bipartite-graph-matching"},"homepage":"https://github.com/guanghechen/algorithm.ts/tree/main/packages/bipartite-graph-matching#readme","keywords":["algorithm","bipartite-graph-matching","bipartite-graph-matching + priority-queue","shortest path","single source shortest path"],"main":"lib/cjs/index.js","module":"lib/esm/index.js","types":"lib/types/index.d.ts","source":"src/index.ts","license":"MIT","engines":{"node":">= 14.15.0"},"scripts":{"build":"cross-env NODE_ENV=production rollup -c ../../rollup.config.js","prebuild":"rimraf lib/ && tsc -p tsconfig.src.json --emitDeclarationOnly","prepublishOnly":"cross-env ROLLUP_SHOULD_SOURCEMAP=false yarn build","test":"cross-env TS_NODE_FILES=true jest --config ../../jest.config.js --rootDir ."},"gitHead":"cfc415a6e56d76dcf795421d92dd81ac2a39a5fc","bugs":{"url":"https://github.com/guanghechen/algorithm.ts/issues"},"_id":"@algorithm.ts/bipartite-graph-matching@2.0.12","_nodeVersion":"16.15.1","_npmVersion":"lerna/5.0.0/node@v16.15.1+x64 (linux)","dist":{"integrity":"sha512-TvMshRf1reYbaZ7/22oI4Gy/ztCdGkZFLMCs2GLPemOUoOdnLKrWbxoES8DBy8zKRC3UJlKQsrESBdKOoELKjg==","shasum":"7c3ab69e7603ddef24e7f790574a1e8d046e8f17","tarball":"https://registry.npmjs.org/@algorithm.ts/bipartite-graph-matching/-/bipartite-graph-matching-2.0.12.tgz","fileCount":6,"unpackedSize":12544,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIEoB9jIqqFhmZD7aNxrV+PjT6jVeO5MbvbGly2CR8gnnAiBAkLOu+7bFt9lY8wrcWDGM1MLXjtlUvFK9ry8haP3RLg=="}],"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v4.10.10\r\nComment: https://openpgpjs.org\r\n\r\nwsFzBAEBCAAGBQJinztLACEJED1NWxICdlZqFiEECWMYAoorWMhJKdjhPU1b\r\nEgJ2VmoZnA/+LUPx37+uyCJDOE6nWSafSj+sX6HDCmgUFprN1zHsPRS5W4T0\r\nsm9tLpt64+5v0yC4YQkheF3qwWHwn/tKN/TKgLVlxNbIG2GtNkWdqGDT4+XE\r\nGM2gW5rzkta0EqlTwh6p4zRTkF1H1AFMYJxrAqjQZ1rvIpVSO3Djx03lfc82\r\n8hYF20Mm95Ibow6aGESRakL3bnosiMdUll4z3TGlUR7VqdLqDrXGXWNJkB76\r\n1uqcwFlC89z7hm0xMOFPKHysUAp6DMFh+D2QU605gv43ppyWJi0po2dqoW3z\r\nc59oEVPtujYOLTCHGxyjfQQUzA3oRXomkLf9eyHllWeVZ4qgSKF3SKaQxvgd\r\nrVfHmFlyxVVlImm7Zr8q4ttI+jbutpEUPsnjlm9DWDpdu43NjS//rcX2rbwH\r\nlt+AgwUUrIKdEAzNFcGyxwyiMWdQoSB1TqI1G4xzGZQeBNWVtNRP6BAi8EQA\r\nPbnzdJD1VS82kTbsVMCErBZQLayp2zBOC9JuwV3VmRVs0aQ3FeQTprEPs8ep\r\n9RQvVj1F6+JRhfHv3cZbFeuzWdRPwjS27EDSGDAXZqRL1BtwH317rcIR2oxY\r\nyczJgG4wEAPCDbG4fDpKWye2ZTRYUihrh4pNopE4lCeV9EQ2SfXqae4okIBh\r\nlmCCG6Uh9ZCVZqk3KeVeQb/OD4HPH4HRMy8=\r\n=AlgR\r\n-----END PGP SIGNATURE-----\r\n"},"_npmUser":{"name":"lemonclown","email":"me.guanghechen@gmail.com"},"directories":{},"maintainers":[{"name":"lemonclown","email":"me.guanghechen@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/bipartite-graph-matching_2.0.12_1654602571328_0.5349494574652305"},"_hasShrinkwrap":false},"2.0.13":{"name":"@algorithm.ts/bipartite-graph-matching","version":"2.0.13","description":"The algorithm to find the maximum matching of the bipartite graph.","author":{"name":"guanghechen","url":"https://github.com/guanghechen/"},"repository":{"type":"git","url":"git+https://github.com/guanghechen/algorithm.ts.git","directory":"packages/bipartite-graph-matching"},"homepage":"https://github.com/guanghechen/algorithm.ts/tree/main/packages/bipartite-graph-matching#readme","keywords":["algorithm","bipartite-graph-matching","bipartite-graph-matching + priority-queue","shortest path","single source shortest path"],"main":"lib/cjs/index.js","module":"lib/esm/index.js","types":"lib/types/index.d.ts","source":"src/index.ts","license":"MIT","engines":{"node":">= 14.15.0"},"scripts":{"build":"cross-env NODE_ENV=production rollup -c ../../rollup.config.js","prebuild":"rimraf lib/ && tsc -p tsconfig.src.json --emitDeclarationOnly","prepublishOnly":"cross-env ROLLUP_SHOULD_SOURCEMAP=false yarn build","test":"cross-env TS_NODE_FILES=true jest --config ../../jest.config.js --rootDir ."},"gitHead":"ebd6447586d9958adaff5218e91768eda82b5bec","bugs":{"url":"https://github.com/guanghechen/algorithm.ts/issues"},"_id":"@algorithm.ts/bipartite-graph-matching@2.0.13","_nodeVersion":"16.15.1","_npmVersion":"lerna/5.1.6/node@v16.15.1+x64 (linux)","dist":{"integrity":"sha512-FWRzGxKORX04vG/hKkjfLIQyTjqNGSVHZMCXvkn8gKUmIvr8IIv8kPQa8M3/jg0XhLIKqfl2ESN6dt0MFMlCzQ==","shasum":"c6e6c42bff553905ac386fce623c8edc205540aa","tarball":"https://registry.npmjs.org/@algorithm.ts/bipartite-graph-matching/-/bipartite-graph-matching-2.0.13.tgz","fileCount":6,"unpackedSize":12544,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCClFut8Y+OyrRBlgfpzE6BHc0XtqyQfX1K9IIp3pYS+AIgekKRqC6Qg3I5BVhgs1qBi+CdN8p8hEZ95zf1KlGm4CA="}],"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v4.10.10\r\nComment: https://openpgpjs.org\r\n\r\nwsFzBAEBCAAGBQJit99fACEJED1NWxICdlZqFiEECWMYAoorWMhJKdjhPU1b\r\nEgJ2Vmpldg//cAnMdAiwFavQ7J20YUdQeBBX+uhD3JA/V/evGmQR63bvrGFv\r\ny07NDA92jj2jbXQ0glI5ZkwA3ECmVr0F5lrY+EpLgkPcdzcfdIyF5xGEFS9m\r\nksP9b2H7swACDbFELH5GBoh8bRLWblC+8lhDpC7u1oBmVkbb3Cy6eRGH1E5Z\r\njlgc15a1ay7abhEiDbqavpqIWWK2L1XcxaCH1UDQUsoJDddsg6l/jVREIC3z\r\nxQtqptbPEP1d+ik49iofgTTHdZlfxhwv1Xc2gcnpXR02M5CRXxFWM+dH5lOB\r\nVgyQL+EftGg+UhoZ1/OET2+ulrDT/MCiRmxPkhm9WFZcz4M1PHbbbnYaXEgo\r\n4jtuxmhWzpRZOpvHjUwxXfTORK8QDJYQZiy5K3OMQ0f04IGnhRhy9nKD3byM\r\nRFqfnllhLRxhN/mgA6ZURzvpydoPmhIhEhEwfkymnC+KnK0AhPsuJrof1xbg\r\ndL/244weR5aUaqMqdODoxfE5xcwCnPw8bGPpx9SFw5AVONktJNL0BikUO50f\r\n1g081Km1cCOHNWjdCU+dzY3I75/KyVQ7bqG4Qr2S/wLAAEb0ehcrNOwJ3s3W\r\nEBppv0LlSYcZooc4Nqxanf/oJ74rd+Ic1f8N/l9o2HYv9Pihr47hB+ZrF3hm\r\nl0jsmRjmbbNrzUy7Q/JJb2tgq9iQxS6yAqA=\r\n=Y01G\r\n-----END PGP SIGNATURE-----\r\n"},"_npmUser":{"name":"lemonclown","email":"me.guanghechen@gmail.com"},"directories":{},"maintainers":[{"name":"lemonclown","email":"me.guanghechen@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/bipartite-graph-matching_2.0.13_1656217439307_0.6938060132420034"},"_hasShrinkwrap":false},"2.0.14":{"name":"@algorithm.ts/bipartite-graph-matching","version":"2.0.14","description":"The algorithm to find the maximum matching of the bipartite graph.","author":{"name":"guanghechen","url":"https://github.com/guanghechen/"},"repository":{"type":"git","url":"git+https://github.com/guanghechen/algorithm.ts.git#release-2.x.x","directory":"packages/bipartite-graph-matching"},"homepage":"https://github.com/guanghechen/algorithm.ts/tree/release-2.x.x/packages/bipartite-graph-matching#readme","keywords":["algorithm","bipartite-graph-matching","bipartite-graph-matching + priority-queue","shortest path","single source shortest path"],"main":"lib/cjs/index.js","module":"lib/esm/index.js","types":"lib/types/index.d.ts","source":"src/index.ts","license":"MIT","engines":{"node":">= 14.15.0"},"scripts":{"build":"cross-env NODE_ENV=production rollup -c ../../rollup.config.js","prebuild":"rimraf lib/","prepublishOnly":"cross-env ROLLUP_SHOULD_SOURCEMAP=false yarn build","test":"cross-env TS_NODE_FILES=true jest --config ../../jest.config.js --rootDir ."},"gitHead":"53a24624195c9f09422c9769c552f9066bc22c70","bugs":{"url":"https://github.com/guanghechen/algorithm.ts/issues"},"_id":"@algorithm.ts/bipartite-graph-matching@2.0.14","_nodeVersion":"16.15.1","_npmVersion":"lerna/5.4.3/node@v16.15.1+x64 (linux)","dist":{"integrity":"sha512-UFlUWMgUKHTUgrGRRa6Fk47IYg+OZrOTU23YYPhE58YNUmpUIv2k0KfuOh+nl2YLprC7DOwY2ZjqD93I7312+g==","shasum":"892bd0b56a71ee2a4c8cc2bb96fde2be7607be99","tarball":"https://registry.npmjs.org/@algorithm.ts/bipartite-graph-matching/-/bipartite-graph-matching-2.0.14.tgz","fileCount":6,"unpackedSize":12589,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIA6aXs/1tZru68rW4LA1os5o8lRMqd5sTJxMllsHjkN0AiAM7EExKAbXIlkqf+oW5CvkwW1zs3BGWuwC5Yync3ebeg=="}],"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v4.10.10\r\nComment: https://openpgpjs.org\r\n\r\nwsFzBAEBCAAGBQJjChnrACEJED1NWxICdlZqFiEECWMYAoorWMhJKdjhPU1b\r\nEgJ2VmrhvhAAlfV9O6Nnp+K+pDFCBydcGx24QYMdUqX7YFloMs4ELuT02/Fd\r\n42PfO9wRBdalcEmS3K7hoaGdICNndgQTriDRtlAn9ZQU8/wNtO55HHkKoUzf\r\nVuQ1o5qYEixd3kcwZubVH4VEqUpTQxnMz9plcUY1/PR45mw6wtvny5EiCSb8\r\nS7UnKyUpzATB8CJNVyGkkPje0JvofhWVDDaOkFLo4gAxUTA9/IL1M8qnGFwX\r\ndChUWSybw5oIq2hQgwM4CKPaAv1yABtEY4H6vE0tdFbNjOlE+vLgGmGy/AJk\r\nkT7r/CB44LlpeSDu44geT+R8CGR72bMODYTq93udEHjLUCEOmFecz8JXo+cJ\r\nFzNYwcJ3wtaiEgiRdKYlmiIvsOS0yKukq5ByfaWRewgYusdrJnpW4AiHzQ+S\r\nR0zFttQ4y7Nmx+mz/2cEXovUbPS20Smis169jUTMN0MVcYfkLdgqvj9HrtLJ\r\noHBghWGQju6dgxBKfkkcQYxijPupXdnoc3BmRTxwrFxWKeDef5QpagHYbt16\r\nlFzNTE0x1MbQpCQ3xpxN6Ezkcpj0wTR0jzgj4RcK0ShNN52UtzDwvbXjJ3VQ\r\neapVeLsCRbO1414gJTSPXwac7/bskTN9ZxuIB6Uk3AXuwyb4R+K/5RX2cuEF\r\nWY31AEXrOgesavENSZPBre3+B9Ea890NkLc=\r\n=v9Lc\r\n-----END PGP SIGNATURE-----\r\n"},"_npmUser":{"name":"lemonclown","email":"me.guanghechen@gmail.com"},"directories":{},"maintainers":[{"name":"lemonclown","email":"me.guanghechen@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/bipartite-graph-matching_2.0.14_1661606379178_0.5822300624693475"},"_hasShrinkwrap":false}},"time":{"created":"2022-02-06T07:23:14.591Z","2.0.0":"2022-02-06T07:23:14.808Z","modified":"2022-08-27T13:19:39.459Z","2.0.1":"2022-02-22T13:15:52.761Z","2.0.2":"2022-02-24T07:55:40.871Z","2.0.3":"2022-02-24T10:12:09.016Z","2.0.4":"2022-03-20T14:51:05.697Z","2.0.5":"2022-03-23T13:33:44.027Z","2.0.6":"2022-03-26T04:48:38.030Z","2.0.7-alpha.0":"2022-03-27T16:12:08.701Z","2.0.7-alpha.1":"2022-04-03T10:35:46.493Z","2.0.7":"2022-04-03T15:41:24.901Z","2.0.8-alpha.0":"2022-04-05T15:58:56.967Z","2.0.8":"2022-04-10T11:29:23.242Z","2.0.9":"2022-04-10T15:05:57.254Z","2.0.10":"2022-04-12T14:58:29.140Z","2.0.11":"2022-04-19T13:15:41.861Z","2.0.12":"2022-06-07T11:49:31.526Z","2.0.13":"2022-06-26T04:23:59.453Z","2.0.14":"2022-08-27T13:19:39.369Z"},"maintainers":[{"name":"lemonclown","email":"me.guanghechen@gmail.com"}],"description":"The algorithm to find the maximum matching of the bipartite graph.","homepage":"https://github.com/guanghechen/algorithm.ts/tree/release-2.x.x/packages/bipartite-graph-matching#readme","keywords":["algorithm","bipartite-graph-matching","bipartite-graph-matching + priority-queue","shortest path","single source shortest path"],"repository":{"type":"git","url":"git+https://github.com/guanghechen/algorithm.ts.git#release-2.x.x","directory":"packages/bipartite-graph-matching"},"author":{"name":"guanghechen","url":"https://github.com/guanghechen/"},"bugs":{"url":"https://github.com/guanghechen/algorithm.ts/issues"},"license":"MIT","readme":"<header>\n  <h1 align=\"center\">\n    <a href=\"https://github.com/guanghechen/algorithm.ts/tree/release-2.x.x/packages/bipartite-graph-matching#readme\">@algorithm.ts/bipartite-graph-matching</a>\n  </h1>\n  <div align=\"center\">\n    <a href=\"https://www.npmjs.com/package/@algorithm.ts/bipartite-graph-matching\">\n      <img\n        alt=\"Npm Version\"\n        src=\"https://img.shields.io/npm/v/@algorithm.ts/bipartite-graph-matching.svg\"\n      />\n    </a>\n    <a href=\"https://www.npmjs.com/package/@algorithm.ts/bipartite-graph-matching\">\n      <img\n        alt=\"Npm Download\"\n        src=\"https://img.shields.io/npm/dm/@algorithm.ts/bipartite-graph-matching.svg\"\n      />\n    </a>\n    <a href=\"https://www.npmjs.com/package/@algorithm.ts/bipartite-graph-matching\">\n      <img\n        alt=\"Npm License\"\n        src=\"https://img.shields.io/npm/l/@algorithm.ts/bipartite-graph-matching.svg\"\n      />\n    </a>\n    <a href=\"#install\">\n      <img\n        alt=\"Module Formats: cjs, esm\"\n        src=\"https://img.shields.io/badge/module_formats-cjs%2C%20esm-green.svg\"\n      />\n    </a>\n    <a href=\"https://github.com/nodejs/node\">\n      <img\n        alt=\"Node.js Version\"\n        src=\"https://img.shields.io/node/v/@algorithm.ts/bipartite-graph-matching\"\n      />\n    </a>\n    <a href=\"https://github.com/facebook/jest\">\n      <img\n        alt=\"Tested with Jest\"\n        src=\"https://img.shields.io/badge/tested_with-jest-9c465e.svg\"\n      />\n    </a>\n    <a href=\"https://github.com/prettier/prettier\">\n      <img\n        alt=\"Code Style: prettier\"\n        src=\"https://img.shields.io/badge/code_style-prettier-ff69b4.svg?style=flat-square\"\n      />\n    </a>\n  </div>\n</header>\n<br/>\n\n\nA typescript implementation of the algorithm to find the maximum [matching][wikipedia-matching] of\nthe [bipartite graph][wikipedia-bipartite-graph].\n\nThe following definition is quoted from Wikipedia (https://en.wikipedia.org/wiki/Matching_(graph_theory)):\n\n> A maximal matching is a matching $M$ of a graph $G$ that is not a subset of any other matching. A\n> matching $M$ of a graph $G$ is maximal if every edge in $G$ has a non-empty intersection with at\n> least one edge in $M$.\n>\n> A maximum matching (also known as maximum-cardinality matching) is a matching that contains the\n> largest possible number of edges. There may be many maximum matchings. The matching number\n> $\\displaystyle \\nu (G)$ of a graph $G$ is the size of a maximum matching. Every maximum matching\n> is maximal, but not every maximal matching is a maximum matching. The following figure shows\n> examples of maximum matchings in the same three graphs.\n\n\n\n## Install\n\n* npm\n\n  ```bash\n  npm install --save @algorithm.ts/bipartite-graph-matching\n  ```\n\n* yarn\n\n  ```bash\n  yarn add @algorithm.ts/bipartite-graph-matching\n  ```\n\n* deno\n\n  ```typescript\n  import { createBipartiteGraphMatching } from 'https://raw.githubusercontent.com/guanghechen/algorithm.ts/main/packages/bipartite-graph-matching/src/index.ts'\n  ```\n\n## Usage\n\n* Simple\n\n  ```typescript\n  import { createBipartiteGraphMatching } from '@algorithm.ts/bipartite-graph-matching'\n\n  const matching = createBipartiteGraphMatching()\n  matching.init(4)\n  matching.maxMatch() // => 0\n\n  matching.addEdge(0, 1)\n  matching.addEdge(0, 2)\n  matching.addEdge(0, 3)\n  matching.maxMatch() // => 1\n\n  matching.addEdge(2, 3)\n  matching.maxMatch() // => 2\n  ```\n\n### Example\n\n* A solution for leetcode \"Maximum Students Taking Exam\"\n  (https://leetcode.com/problems/maximum-students-taking-exam/):\n\n  ```typescript\n  import { createBipartiteGraphMatching } from '@algorithm.ts/bipartite-graph-matching'\n\n  export function maxStudents(seats: string[][]): number {\n    const R: number = seats.length\n    if (R <= 0) return 0\n\n    const C: number = seats[0].length\n    if (C <= 0) return 0\n\n    let total = 0\n    const seatCodes: number[][] = new Array(R)\n    for (let r = 0; r < R; ++r) seatCodes[r] = new Array(C).fill(-1)\n\n    for (let r = 0; r < R; ++r) {\n      for (let c = 0; c < C; ++c) {\n        if (seats[r][c] === '.') {\n          seatCodes[r][c] = total\n          total += 1\n        }\n      }\n    }\n\n    if (total <= 0) return 0\n    if (total === 1) return 1\n\n    const matching = createBipartiteGraphMatching()\n    matching.init(total)\n    for (let r = 0; r < R; ++r) {\n      for (let c = 0; c < C; ++c) {\n        const u: number = seatCodes[r][c]\n        if (u > -1) {\n          if (r > 0) {\n            // Check upper left\n            if (c > 0 && seatCodes[r - 1][c - 1] > -1) {\n              matching.addEdge(u, seatCodes[r - 1][c - 1])\n            }\n\n            // Check upper right\n            if (c + 1 < C && seatCodes[r - 1][c + 1] > -1) {\n              matching.addEdge(u, seatCodes[r - 1][c + 1])\n            }\n          }\n\n          // Check left\n          if (c > 0 && seatCodes[r][c - 1] > -1) {\n            matching.addEdge(u, seatCodes[r][c - 1])\n          }\n        }\n      }\n    }\n\n    const totalPaired: number = matching.maxMatch()\n    return total - totalPaired\n  }\n  ```\n\n\n## Related\n\n* 《算法竞赛入门经典（第2版）》（刘汝佳）： P347-P348 二分图最大匹配\n* [二分图 | 光和尘][bipartite-graph]\n* [Bipartite graph | Wikipedia][wikipedia-bipartite-graph]\n* [Matching (graph theory) | Wikipedia][wikipedia-matching]\n\n\n[homepage]: https://github.com/guanghechen/algorithm.ts/tree/release-2.x.x/packages/bipartite-graph-matching#readme\n[wikipedia-bipartite-graph]: https://en.wikipedia.org/wiki/Bipartite_graph\n[wikipedia-matching]: https://en.wikipedia.org/wiki/Matching_(graph_theory)\n[bipartite-graph]: https://me.guanghechen.com/post/algorithm/graph/bipartite-graph/","readmeFilename":"README.md"}