{
  "name": "bipartite-vertex-cover",
  "version": "1.0.0",
  "description": "Minimal vertex cover for bipartite graphs",
  "main": "vcover.js",
  "directories": {
    "test": "test"
  },
  "dependencies": {
    "bipartite-matching": "^1.0.0",
    "iota-array": "^1.0.0",
    "typedarray-pool": "^1.0.0"
  },
  "devDependencies": {
    "tape": "~2.3.2",
    "dup": "~0.0.0",
    "tap": "~0.4.8"
  },
  "scripts": {
    "test": "tap test/*.js"
  },
  "repository": {
    "type": "git",
    "url": "git://github.com/mikolalysenko/bipartite-vertex-cover.git"
  },
  "keywords": [
    "vertex",
    "cover",
    "bipartite",
    "graph",
    "konig",
    "theorem",
    "edge",
    "matching",
    "dual"
  ],
  "author": "Mikola Lysenko",
  "license": "MIT",
  "bugs": {
    "url": "https://github.com/mikolalysenko/bipartite-vertex-cover/issues"
  },
  "homepage": "https://github.com/mikolalysenko/bipartite-vertex-cover"
}