{
  "name": "graphology-shortest-path",
  "version": "2.1.0",
  "description": "Shortest path functions for graphology.",
  "main": "index.js",
  "types": "index.d.ts",
  "files": [
    "*.d.ts",
    "astar.js",
    "dijkstra.js",
    "index.js",
    "indexed-brandes.js",
    "unweighted.js",
    "utils.js"
  ],
  "scripts": {
    "prepublishOnly": "npm test",
    "test": "mocha"
  },
  "repository": {
    "type": "git",
    "url": "git+https://github.com/graphology/graphology.git"
  },
  "keywords": [
    "graph",
    "graphology",
    "shortest path",
    "dijkstra",
    "a star"
  ],
  "author": {
    "name": "Guillaume Plique",
    "url": "http://github.com/Yomguithereal"
  },
  "license": "MIT",
  "bugs": {
    "url": "https://github.com/graphology/graphology/issues"
  },
  "homepage": "https://github.com/graphology/graphology#readme",
  "peerDependencies": {
    "graphology-types": ">=0.20.0"
  },
  "dependencies": {
    "@yomguithereal/helpers": "^1.1.1",
    "graphology-indices": "^0.17.0",
    "graphology-utils": "^2.4.3",
    "mnemonist": "^0.39.0"
  }
}