package.json

{
  "name": "l1-path-finder",
  "version": "1.0.0",
  "description": "Fast shortest path finder for grids",
  "main": "lib/planner.js",
  "directories": {
    "test": "test"
  },
  "dependencies": {
    "binary-search-bounds": "^1.0.0",
    "contour-2d": "^1.0.0",
    "ndarray": "^1.0.16",
    "ndarray-ops": "^1.2.2",
    "ndarray-prefix-sum": "^1.0.0",
    "robust-orientation": "^1.1.3",
    "uniq": "^1.0.1"
  },
  "devDependencies": {
    "astar-andrea": "^1.0.0",
    "bitmap-to-boxes": "^1.0.0",
    "colormap": "^2.0.1",
    "easystarjs": "0.3.0",
    "mouse-change": "^1.1.1",
    "ndarray-imshow": "^1.0.1",
    "ndarray-unpack": "^1.0.0",
    "nets": "^3.1.0",
    "node-pathfinding": "^0.2.6",
    "parse-grid-bench": "^1.0.1",
    "pathfinding": "^0.4.17",
    "right-now": "^1.0.0",
    "shuffle-array": "^0.1.0",
    "tape": "^4.0.0"
  },
  "scripts": {
    "test": "tape test/*.js",
    "bench": "node bench/bench.js"
  },
  "repository": {
    "type": "git",
    "url": "https://github.com/mikolalysenko/l1-path-finder.git"
  },
  "keywords": [
    "path",
    "dijkstra",
    "astar",
    "a*",
    "grid",
    "shortest",
    "plan",
    "a",
    "star",
    "rectilinear",
    "orthogonal",
    "l1",
    "optimal",
    "game",
    "search",
    "plan",
    "planner"
  ],
  "author": "Mikola Lysenko",
  "license": "MIT",
  "bugs": {
    "url": "https://github.com/mikolalysenko/l1-path-finder/issues"
  },
  "homepage": "https://github.com/mikolalysenko/l1-path-finder"
}