randomized-hopcroft-karp/package.json

An algorithm for maximum cardinality matching of bipartite graph

{
  "name": "randomized-hopcroft-karp",
  "description": "An algorithm for maximum cardinality matching of bipartite graph",
  "version": "0.2.0",
  "author": {
    "name": "Kazuaki Tanida",
    "url": "https://github.com/slaypni"
  },
  "repository": {
    "type": "git",
    "url": "https://github.com/slaypni/randomized-hopcroft-karp.git"
  },
  "keywords": [
    "typescript",
    "bipartite",
    "matching"
  ],
  "license": "MIT",
  "bugs": {
    "url": "https://github.com/slaypni/randomized-hopcroft-karp/issues"
  },
  "main": "dist/index.js",
  "types": "dist/index.d.ts",
  "scripts": {
    "build": "tsc -p tsconfig.build.json",
    "clean": "rimraf dist",
    "test": "jest",
    "prepublishOnly": "npm run-script clean && npm run-script build"
  },
  "devDependencies": {
    "@types/jest": "^26.0.20",
    "jest": "^26.6.3",
    "rimraf": "^3.0.2",
    "ts-jest": "^26.5.0",
    "typescript": "^4.1.3"
  },
  "dependencies": {}
}